论文信息 - A note on computational studies for solving transportation problems

A note on computational studies for solving transportation problems

This note provides a mathematical explanation for the superiority of certain pivot criterion heuristics when using the Row-Column Sum Method to solve transportation problems. In addition, new pivot criteria are developed using this mathematical explanation which are shown to be computationally superior to the previously best pivot criteria.

Fred W. Glover | Darwin Klingman | David Karney

[1] Fred Glover,et al. A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[2] Jack B. Dennis,et al. A High-Speed Computer Technique for the Transportation Problem , 1958, JACM.

[3] E. Johnsen. A. Charnes and W. W. Cooper: Management Models and Industrial Applications of linear Programming, Vol. I. and Vol. II, ialt 859 sider. John Wiley and Sons, Inc. London 1961. lait 183 sh/-. , 1962 .

[4] Gerald L. Thompson,et al. Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[5] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[6] Darwin Klingman,et al. The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .