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

DOI10.1016/0167-6377(92)90048-8MaRDI QIDQ1200795zbMATH OpenOpenAlexFDO

Authors 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

dual algorithmminimum cost circulation problemnetwork flowpolynomial algorithms

Mathematics Subject Classification ID

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

Recommendations

• A strongly polynomial minimum cost circulation algorithm
• scientific article; zbMATH DE number 3900474
• Finding Minimum-Cost Circulations by Successive Approximation
• Finding minimum-cost circulations by canceling negative cycles
• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Cites work

• A bad network problem for the simplex method and other minimum cost flow algorithms
• A dual algorithm for submodular flow problems
• A Primal Algorithm to Solve Network Flow Problems with Convex Costs
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Canceling most helpful total cuts for minimum cost network flow
• Computing maximum mean cuts
• Diagonal similarity and equivalence for matrices over groups with 0
• Finding minimum-cost circulations by canceling negative cycles
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• scientific article; zbMATH DE number 3302125 (Why is no real title available?)
• 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

Cited in

(11)

• A new saling algorithm for the maximum mean cut problem
• Approximate binary search algorithms for mean cuts and cycles
• Computing maximum mean cuts
• How to compute least infeasible flows
• A new approach for computing a most positive cut using the minimum flow algorithms
• Minimax inverse problems of minimum cuts
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
• Note on Weintraub’s Minimum-Cost Circulation Algorithm
• Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Maximum flow and minimum-cost flow in almost-linear time

This page was built for publication: Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200795)