A comparison of pivot selection rules for primal simplex based network codes
From MaRDI portal
Publication:794141
DOI10.1016/0167-6377(83)90025-1zbMath0539.65047OpenAlexW2052715133MaRDI QIDQ794141
Melissa Mead, Fred Glover, David Gibby, Darwin D. Klingman
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90025-1
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Pivot Strategies for Primal-Simplex Network Codes
- Testing of a large-scale network optimization program
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm