A new scaling algorithm for the minimum cost network flow problem
From MaRDI portal
DOI10.1016/S0167-6377(99)00047-4zbMATH Open0961.90011MaRDI QIDQ1970413FDOQ1970413
Authors: Donald Goldfarb, Zhiying Jin 
Publication date: 12 December 2000
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
- A new strongly polynomial dual network simplex algorithm
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A new algorithm for finding the minimum cost flow using the duality principle
- On the computational behavior of a polynomial-time network flow algorithm
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
Cites Work
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Fibonacci heaps and their uses in improved network optimization algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Scaling algorithms for network problems
- Finding Minimum-Cost Circulations by Successive Approximation
- A capacity scaling algorithm for the constrained maximum flow problem
- A strongly polynomial minimum cost circulation algorithm
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Title not available (Why is that?)
- Polynomial dual network simplex algorithms
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- Title not available (Why is that?)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- Title not available (Why is that?)
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- Title not available (Why is that?)
Cited In (7)
- A new algorithm for general matching problems using network flow subproblems
- A computational study of the capacity scaling algorithm for the maximum flow problem
- A new algorithm for finding the minimum cost flow using the duality principle
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
- Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory
- An affine scaling method for solving network flow problems
This page was built for publication: A new scaling algorithm for the minimum cost network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970413)
