How to compute least infeasible flows
From MaRDI portal
Publication:1373747
DOI10.1007/BF02614370zbMath0889.90065MaRDI QIDQ1373747
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Finding minimum-cost flows by double scaling
- Submodular functions and optimization
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- Diagnosing infeasibilities in network flow problems
- A new saling algorithm for the maximum mean cut problem
- Approximate binary search algorithms for mean cuts and cycles
- Computing maximum mean cuts
- Consistency, redundancy, and implied equalities in linear systems
- Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
- On a routing problem
- Finding Minimum-Cost Circulations by Successive Approximation
- Note on Weintraub’s Minimum-Cost Circulation Algorithm
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
- A Primal Algorithm to Solve Network Flow Problems with Convex Costs
- A Fast Parametric Maximum Flow Algorithm and Applications
- Canceling most helpful total cuts for minimum cost network flow
- Faster parametric shortest path and minimum‐balance algorithms
