Polynomial dual network simplex algorithms
Authors:
- 1 June 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 60 (1-3) , 255-276
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation ProblemMathematics of Operations Research, 1991
- Use of dynamic trees in a network simplex algorithm for the maximum flow problemMathematical Programming, 1991
- A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) timeMathematical Programming, 1990
- Signature Methods for the Assignment ProblemOperations Research, 1985
- On the simplex algorithm for networks and generalized networks1985
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979