How to compute least infeasible flows
Author:
- 1 August 1997
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 78 (2) , 179-194
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computing maximum mean cutsDiscrete Applied Mathematics, 1994
- A new scaling algorithm for the maximum mean cut problemAlgorithmica, 1994
- Two strongly polynomial cut cancelling algorithms for minimum cost network flowDiscrete Applied Mathematics, 1993
- Canceling most helpful total cuts for minimum cost network flowNetworks, 1993
- Finding minimum-cost flows by double scalingMathematical Programming, 1992
- Faster parametric shortest path and minimum‐balance algorithmsNetworks, 1991
- Note on Weintraub’s Minimum-Cost Circulation AlgorithmSIAM Journal on Computing, 1989
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual InfeasibilityIMA Journal of Management Mathematics, 1986
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithmMathematical Programming, 1983