A new scaling algorithm for the minimum cost network flow problem
From MaRDI portal
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
- scientific article; zbMATH DE number 3718824 (Why is no real title available?)
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
- scientific article; zbMATH DE number 515930 (Why is no real title available?)
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A capacity scaling algorithm for the constrained maximum flow problem
- A note on two problems in connexion with graphs
- A strongly polynomial minimum cost circulation algorithm
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost flows by double scaling
- Network flows. Theory, algorithms, and applications.
- On the computational behavior of a polynomial-time network flow algorithm
- Polynomial dual network simplex algorithms
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- Scaling algorithms for network problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(7)- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
- A new algorithm for general matching problems using network flow subproblems
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- 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
- An affine scaling method for solving network flow problems
- Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory
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)
