An improved version of the out-of-kilter method and a comparative study of computer codes
From MaRDI portal
Publication:4073126
DOI10.1007/BF01585504zbMath0313.90044MaRDI QIDQ4073126
Richard S. Barr, Fred Glover, Darwin D. Klingman
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (13)
Implementation and analysis of a variant of the dual method for the capacitated transshipment problem ⋮ A classroom/time assignment model ⋮ A survey of dynamic network flows ⋮ A surrogate and Lagrangian approach to constrained network problems ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Using shortest paths in some transshipment problems with concave costs ⋮ Primal transportation and transshipment algorithms ⋮ The alternating basis algorithm for assignment problems ⋮ The generalized alternating path algorithm for transportation problems ⋮ Testing of a large-scale network optimization program ⋮ The flow circulation sharing problem ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ Representing inverses in pure network flow optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A High-Speed Computer Technique for the Transportation Problem
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Coding the transportation problem
- An Improved Starting Algorithm for the Ford-Fulkerson Approach to the Transportation Problem
- A Treatment of Transportation Problems by Primal Partition Programming
- Flow Networks and Combinatorial Operations Research
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- An “out-of-kilter” algorithm for solving minimum cost potential problems
This page was built for publication: An improved version of the out-of-kilter method and a comparative study of computer codes