Canceling most helpful total cuts for minimum cost network flow

DOI10.1002/net.3230230106zbMath0781.90034OpenAlexW1967030975MaRDI QIDQ5285477

Thomas R. Ervolina, S. Thomas McCormick

Publication date: 29 June 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230106

zbMATH Keywords

polynomial algorithmminimum cost network flowmost helpful total cut cancelling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

How to compute least infeasible flows ⋮ The minimal average cost flow problem ⋮ Algorithms for the minimum cost circulation problem based on maximizing the mean improvement ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ A new approach for computing a most positive cut using the minimum flow algorithms

Cites Work

• Unnamed Item