A new scaling algorithm for the minimum cost network flow problem
From MaRDI portal
Publication:1970413
DOI10.1016/S0167-6377(99)00047-4zbMath0961.90011MaRDI QIDQ1970413
Publication date: 12 December 2000
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (2)
Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Polynomial dual network simplex algorithms
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- A strongly polynomial minimum cost circulation algorithm
- Scaling algorithms for network problems
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Finding Minimum-Cost Circulations by Successive Approximation
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- A capacity scaling algorithm for the constrained maximum flow problem
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
This page was built for publication: A new scaling algorithm for the minimum cost network flow problem
