An efficient implementation of the network simplex method
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 83-111
- https://doi.org/10.1007/bfb0121089
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- A network simplex methodMathematical Programming, 1976
- Past, present and future of large scale transshipment computer codes and applicationsComputers & Operations Research, 1975
- An improved version of the out-of-kilter method and a comparative study of computer codesMathematical Programming, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961
- Computation of maximal flows in networksNaval Research Logistics Quarterly, 1955
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955