Reoptimization procedures for bounded variable primal simplex network algorithms
- 28 February 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 23 (2) , 256-263
- https://doi.org/10.1016/0377-2217(86)90245-6
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A New Optimization Method for Large Scale Fixed Charge Transportation ProblemsOperations Research, 1981
- Technical Note—Computational Comparison among Three Multicommodity Network Flow AlgorithmsOperations Research, 1980
- Solving the Pipe Network Analysis Problem Using Optimization TechniquesManagement Science, 1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation ProblemManagement Science, 1976
- Validation of subgradient optimizationMathematical Programming, 1974
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation ProblemsManagement Science, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958