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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
-
Concave generalized flows with applications to market equilibria
Végh, Lászlo A., (2014)
-
Solving crop planning and rotation problems in a sustainable agriculture perspective
Benini, Mario, (2023)
-
An efficient local search heuristic for the double row layout problem with asymmetric material flow
Murray, Chase C., (2013)
- More ...
-
An accelerated Newton-Dinkelbach method and its application to two variables per inequality systems
Dadush, Daniel, (2023)
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
Geometric rescaling algorithms for submodular function minimization
Dadush, Dan, (2021)
- More ...