论文信息 - The Solution of Algebraic Assignment and Transportation Problems

The Solution of Algebraic Assignment and Transportation Problems

In this paper solution methods for the algebraic transportation problem (ATP) are considered. The ATP covers besides the Hitchcock and the time transportation problem several other types of transportation problems of practical relevance. The solution methods are based on (weakly) admissible transformations which can be determined by maximal flow resp. by shortest path algorithms. Numerical results for these and primal methods applied to sum and bottleneck assignment resp. transportation problems are mentioned.

Rainer E. Burkard | Uwe Zimmermann

[1] Rainer E. Burkard,et al. Kombinatorische optimierung in halbgruppen , 1975 .

[2] Rainer Ernst Burkard. Numerische Erfahrungen mit Summen- und Bottleneck-Zuordnungsproblemen , 1975 .

[3] Gerald L. Thompson,et al. ALGORITHMS FOR MINIMIZING TOTAL COST, BOTTLENECK TIME AND BOTTLENECK SHIPMENT IN TRANSPORTATION PROBLEMS , 1976 .

[4] Robert Garfinkel,et al. The bottleneck transportation problem , 1971 .

[5] Peter L. Hammer,et al. Time‐minimizing transportation problems , 1969 .

[6] L. Collatz,et al. Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen , 1979 .

[7] Rainer E. Burkard,et al. An algebraic approach to assignment problems , 1977, Math. Program..