An affine scaling method for solving network flow problems
From MaRDI portal
Recommendations
- A new scaling algorithm for the minimum cost network flow problem
- scientific article; zbMATH DE number 1086904
- A scaling algorithm for multicommodity flow problems
- The Scaling Network Simplex Algorithm
- scientific article; zbMATH DE number 3869028
- scientific article; zbMATH DE number 515934
- scientific article; zbMATH DE number 1552018
- Scaling algorithms for network problems
- A computational comparison of the network simplex method with the dual affine scaling method
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
Cites work
- A new polynomial-time algorithm for linear programming
- A simple proof of a primal affine scaling method
- A study of preconditioners for network interior point methods
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- New Preconditioners for KKT Systems of Network Flow Problems
Cited in
(2)
This page was built for publication: An affine scaling method for solving network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648994)