On the computational behavior of a polynomial-time network flow algorithm
From MaRDI portal
Publication:1190598
DOI10.1007/BF01586039zbMath0767.90013OpenAlexW2037823059MaRDI QIDQ1190598
David L. Jensen, Robert G. Bland
Publication date: 26 September 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01586039
Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A fast cost scaling algorithm for submodular flow, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Separation, dimension, and facet algorithms for node flow polyhedra, Multiflows and disjoint paths of minimum total cost, Minimum-cost flow algorithms: an experimental evaluation, An implementation of steepest-descent augmentation for linear programs, Minimum-cost flows in unit-capacity networks, A new scaling algorithm for the minimum cost network flow problem, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- Scaling algorithms for network problems
- Dual coordinate step methods for linear network flow problems
- Decomposition of regular matroids
- Finding minimum-cost flows by double scaling
- Convexification procedures and decomposition methods for nonconvex optimization problems
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- A data structure for dynamic trees
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Monotone networks
- Finding Minimum-Cost Circulations by Successive Approximation
- A unified framework for primal-dual methods in minimum cost network flow problems
- An efficient implementation of the network simplex method
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
