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 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

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

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

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

Zdroj: Computer Science -- Theory & Applications; 2015, p53-66, 14p

Finding Minimum Weighted Generators Of A Path System

Autoři: András Frank The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: András Frank The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.elte.hu/~frank/pub/DIMACS.ps.gz.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.89; http://www.cs.elte.hu/~frank/pub/DIMACS.ps.gz

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.89
http://www.cs.elte.hu/~frank/pub/DIMACS.ps.gz

Multiflows and disjoint paths of minimum total cost.

Autoři: Karzanov, Alexander

Zdroj: Mathematical Programming; Aug1997, Vol. 78 Issue 2, p219-242, 24p

Computer Science -- Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings

Autoři: Lev D. Beklemishev Daniil V. Musatov

Resource Type: eBook.

Témata: Algorithms, Computer science—Mathematics, Discrete mathematics, Computer science, Numerical analysis, Machine theory

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Computer Science, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis