More pathological examples for network flow problems

DOI10.1007/BF01580122zbMath0272.90081OpenAlexW2018732369MaRDI QIDQ5181574

Norman Zadeh

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580122

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

Affirmative action algorithms, Weighted min cost flows, An exterior simplex type algorithm for the minimum cost network flow problem, Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks, Decomposition algorithms for locating minimal cuts in a network, Tight bounds on the number of minimum-mean cycle cancellations and related results, A bad network problem for the simplex method and other minimum cost flow algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows