A strongly polynomial algorithm for generalized flow maximization
Year of publication: |
February 2017
|
---|---|
Authors: | Végh, László A. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 1, p. 179-211
|
Subject: | network flow algorithms | generalized flows | strongly polynomial algorithms | linear programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Concave generalized flows with applications to market equilibria
Végh, Lászlo A., (2014)
-
Approximation limits of linear programs (beyond hierarchies)
Braun, Gábor, (2015)
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
- More ...
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
Geometric rescaling algorithms for submodular function minimization
Dadush, Dan, (2021)
-
On submodular search and machine scheduling
Fokkink, Robbert, (2019)
- More ...