An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Authors:
- 1 April 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (4) , 1176-1190
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On using exterior penalty approaches for solving linear programming problemsComputers & Operations Research, 2001
- A polynomial time primal network simplex algorithm for minimum cost flowsMathematical Programming, 1997
- Chapter 1 Applications of network optimization1995
- A Faster Strongly Polynomial Minimum Cost Flow AlgorithmOperations Research, 1993
- Finding minimum-cost flows by double scalingMathematical Programming, 1992
- An infeasible (exterior point) simplex algorithm for assignment problemsMathematical Programming, 1991
- Solving minimum-cost flow problems by successive approximation1987
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972