Výsledky vyhledávání - purely combinatorial strongly polynomial algorithm

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems: A strongly polynomial algorithm for minimum cost submodular flow problems

Autoři: Satoru Fujishige Hans Röck Uwe Zimmermann

Zdroj: Mathematics of Operations Research. 14:60-69

Témata: minimum cost submodular flow, Analysis of algorithms and problem complexity, scaling, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, tree projection, purely combinatorial strongly polynomial algorithm, 01 natural sciences

Popis souboru: application/xml

A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMAL COST SUBMODULAR FLOW PROBLEMS.

Autoři: Fujishige, Satoru Röck, Hans Zimmermann, Uwe

Zdroj: Mathematics of Operations Research; Feb89, Vol. 14 Issue 1, p60-69, 10p

Témata: ALGORITHMS, POLYNOMIALS, MATHEMATICS, LOGIC

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ∞-norm objectives.

Autoři: Bérczi, Kristóf Mendoza-Cadena, Lydia Mirabel Varga, Kitti

Zdroj: Optimization Letters; Nov2025, Vol. 19 Issue 8, p1665-1690, 26p

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and $\ell_\infty$-norm objectives

Autoři: Bérczi, Kristóf Mendoza-Cadena, Lydia Mirabel Varga, Kitti

Témata: Mathematics - Optimization and Control, Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/2302.13411

An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes.

Autoři: Karzanov, Alexander V.¹ (AUTHOR) akarzanov7@gmail.com

Zdroj: Discrete Optimization. Aug2019, Vol. 33, p118-139. 22p.

Témata: Planar graphs, Algorithms, Integers

A network flow approach to a common generalization of Clar and Fries numbers.

Autoři: Bérczi-Kovács, Erika Frank, András

Zdroj: Discrete Mathematics. Nov2024, Vol. 347 Issue 11, pN.PAG-N.PAG. 1p.

Témata: *POLYNOMIAL time algorithms, *POLYHEDRA, *GENERALIZATION, *BIPARTITE graphs, *ALGORITHMS, *POLYNOMIALS, *DIRECTED graphs

Bayesian generalized network design.

Autoři: Emek, Yuval Kutten, Shay Lavi, Ron a další

Zdroj: Theoretical Computer Science. Nov2020, Vol. 841, p167-185. 19p.

Témata: *POLYNOMIAL time algorithms, *COST shifting, *DECISION making

A Combinatorial Algorithm for the Minimum (2, r)-Metric Problem and Some Generalizations.

Autoři: Karzanov, Alexander V.

Zdroj: Combinatorica; Apr1998, Vol. 18 Issue 4, p549-568, 20p

MATCHING TRIANGLES AND BASING HARDNESS ON AN EXTREMELY POPULAR CONJECTURE.

Autoři: ABBOUD, AMIR WILLIAMS, VIRGINIA VASSILEVSKA HUACHENG YU

Zdroj: SIAM Journal on Computing. 2018, Vol. 47 Issue 3, p1098-1122. 25p.

Témata: *MATHEMATICAL bounds, *POLYNOMIALS, *ALGORITHMS, *COMBINATORICS, *COMPUTATIONAL complexity, *DIRECTED graphs

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes

Autoři: Maxim A. Babenko Alexander V. Karzanov

Zdroj: Lecture Notes in Computer Science ISBN: 9783319202969

Témata: 90C27, 05C10, 05C21, 05C85, 0211 other engineering and technologies, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1410.7208
http://arxiv.org/abs/1410.7208
https://rd.springer.com/chapter/10.1007/978-3-319-20297-6_4
https://link.springer.com/chapter/10.1007/978-3-319-20297-6_4
https://publications.hse.ru/en/chapters/163763600
https://link.springer.com/content/pdf/10.1007%2F978-3-319-20297-6_4.pdf
https://ui.adsabs.harvard.edu/abs/2014arXiv1410.7208B/abstract

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives

Autoři: Kristóf Bérczi Lydia Mirabel Mendoza-Cadena Kitti Varga

Zdroj: Optimization Letters.

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Optimization and Control (math.OC), 0211 other engineering and technologies, FOS: Mathematics, 02 engineering and technology, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2302.13411

Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost: Scaling methods for finding a maximum free multiflow of minimum cost

Autoři: Andrew V. Goldberg Alexander V. Karzanov

Zdroj: Mathematics of Operations Research. 22:90-109

Témata: undirected graph, Combinatorial optimization, half-integer optimal solution, Deterministic network models in operations research, purely combinatorial polynomial algorithms, 0211 other engineering and technologies, 02 engineering and technology, nonnegative integer-valued edge capacities

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1018446
https://doi.org/10.1287/moor.22.1.90

SCALING METHODS FOR FINDING A MAXIMUM FREE MULTIFLOW OF MINIMUM COST.

Autoři: Goldberg, Andrew V. Karzanov, Alexander V.

Zdroj: Mathematics of Operations Research; Feb97, Vol. 22 Issue 1, p90, 20p, 2 Diagrams

Témata: ALGORITHMS, GRAPHIC methods, POLYNOMIALS, COMBINATORICS, INTEGER programming, ELLIPSOIDS, COST, PROBLEM solving

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization.

Autoři: OLVER, NEIL VÉGH, LÁSZLÓ A.

Zdroj: Journal of the ACM; Mar2020, Vol. 67 Issue 2, p1-26, 26p

Témata: ALGORITHMS, POLYNOMIALS, EXPECTATION-maximization algorithms

A STRONGLY POLYNOMIAL ALGORITHM TO SOLVE COMBINATORIAL LINEAR PROGRAMS.

Autoři: Tardos, Eva

Zdroj: Operations Research; Mar/Apr1986, Vol. 34 Issue 2, p250-256, 7p

Témata: ALGORITHMS, LINEAR programming, POLYNOMIALS

Decreasing minimization on M-convex sets: algorithms and applications.

Autoři: Frank, András Murota, Kazuo

Zdroj: Mathematical Programming; Sep2022, Vol. 195 Issue 1/2, p1027-1068, 42p

Témata: GRAPH algorithms, RESOURCE allocation, NONCONVEX programming, POLYNOMIALS

Bayesian Generalized Network Design

Autoři: Emek, Yuval Kutten, Shay Lavi, Ron a další

Témata: Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, 68W25, F.2.2, text

URL: http://arxiv.org/abs/1907.00484

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture

Autoři: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Abboud, Amir a další

Zdroj: SIAM

Témata: General Mathematics, General Computer Science, Article, http://purl.org/eprint/type/JournalArticle

URL: https://hdl.handle.net/1721.1/137622
10.1137/15m1050987

An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes

Autoři: Alexander V. Karzanov

Zdroj: Discrete Optimization. 33:118-139

Témata: FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 90C27, 05C10, 05C12, 05C21, 05C85, 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1803.07020
http://arxiv.org/abs/1803.07020
https://www.sciencedirect.com/science/article/abs/pii/S1572528618300549
https://dblp.uni-trier.de/db/journals/disopt/disopt33.html#Karzanov19

The White Puzzle: A Framework for Computation as a Recursive‑Harmonic Phenomenon

Autoři: KULIK, DEAN