An affine scaling method for solving network flow problems
From MaRDI portal
Publication:4648994
DOI10.1080/09720529.2012.10698361zbMath1254.90276OpenAlexW1986648645MaRDI QIDQ4648994
No author found.
Publication date: 16 November 2012
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: http://www.connectjournals.com/file_html_pdf/1401901H_02_JDMSC_T37_15-1_pp013-029a.pdf
Cites Work
- A new polynomial-time algorithm for linear programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- A study of preconditioners for network interior point methods
- A simple proof of a primal affine scaling method
- New Preconditioners for KKT Systems of Network Flow Problems
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
This page was built for publication: An affine scaling method for solving network flow problems