A least-squares minimum-cost network flow algorithm
- 9 March 2011
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 186 (1) , 119-140
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An exterior simplex type algorithm for the Minimum Cost Network Flow ProblemComputers & Operations Research, 2009
- A Computational Study of Cost Reoptimization for Min-Cost Flow ProblemsINFORMS Journal on Computing, 2006
- A least-squares primal-dual algorithm for solving linear programming problemsOperations Research Letters, 2002
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- An Efficient Implementation of a Scaling Minimum-Cost Flow AlgorithmJournal of Algorithms, 1997
- The relax codes for linear minimum cost network flow problemsAnnals of Operations Research, 1988
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow ProblemsOperations Research, 1988
- An efficient implementation of the network simplex method1986
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- Determining All Nondegenerate Shadow Prices for the Transportation ProblemTransportation Science, 1977