Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

DOI10.1016/0167-6377(92)90048-8zbMath0762.90025OpenAlexW2065932050MaRDI QIDQ1200795

Refael Hassin

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90048-8

zbMATH Keywords

polynomial algorithmsnetwork flowdual algorithmminimum cost circulation problem

Mathematics Subject Classification ID

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

Related Items

Computing maximum mean cuts ⋮ How to compute least infeasible flows ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ A new approach for computing a most positive cut using the minimum flow algorithms ⋮ Minimax inverse problems of minimum cuts ⋮ Approximate binary search algorithms for mean cuts and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• A dual algorithm for submodular flow problems
• Computing maximum mean cuts
• Finding minimum-cost circulations by canceling negative cycles
• Note on Weintraub’s Minimum-Cost Circulation Algorithm
• 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
• Diagonal similarity and equivalence for matrices over groups with 0
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Canceling most helpful total cuts for minimum cost network flow
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems