Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
BURKARD, R.E.: Numerische Erfahrungen mit Summen- und Bottleneck-Zuordnungsproblemen, in Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, hrsg. von L. Collatz, G. Meinardus und H. Werner, Birkäuser Verlag Basel-Stuttgart ISNM Bd. 29(1975), 9–25.
BURKARD, R.E.: Kombinatorische Optimierung in Halbgruppen, in Optimization and Optimal Control hrsg. von R. Bulirsch, W. Oettli und J. Stoer, Springer LN Math. 477(1975), 1–17.
BURKARD, R.E.: A general Hungarian method for the algebraic transportation problem, Report 76-6, Mathematisches Institut der Universität zu Köln, 1976 (submitted for publication).
BURKARD, R.E.; HAHN, W.; ZIMMERMANN, U.: An algebraic approach to assignment problems, Math. Prog. 12(1977), 318–327.
BURKARD, R.E.; ZIMMERMANN, U.: Weakly admissible transformations for solving algebraic assignment and transportation problems, Report 77-03, Mathematisches Institut der Universität zu Köln, 1977, (submitted for publication).
DERIGS, U.: Duality and the algebraic matching problem, submitted for publication.
DERIGS, U.; ZIMMERMANN, U.: An augmenting path method for solving linear bottleneck assignment problems, to appear in Computing.
DERIGS, U.; ZIMMERMANN, U.: An augmenting path method for solving time transportation problems, Report 77-09, Mathematisches Institut der Universität zu Köln, 1977.
GARFINKEL, R.S.; RAO, M.R.:The bottleneck transportation problem, Nav. Res. Log. Quart. 18(1971),465–472.
HAMMER, P.L.: Time minimizing transportation problems, Nav. Res. Log. Quart. 16 (1969),345–357 and 18 (1971),487–490.
SRINIVASAN, V.; THOMPSON, G.L.: Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems, Nav. Res. Log. Quart. 23(1976), 567–595.
ZIMMERMANN, U.: Duality and the algebraic matroid intersection problem, submitted for publication.
ZIMMERMANN, U.: Boole’sche Optimierungsprobleme mit separabler Zielfunktion und matroidalen Restriktionen, Dissertation 1976, Mathematisches Institut der Universität zu Köln.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burkard, R.E., Zimmermann, U. (1978). The Solution of Algebraic Assignment and Transportation Problems. In: Henn, R., Korte, B., Oettli, W. (eds) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95322-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-95322-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08842-4
Online ISBN: 978-3-642-95322-4
eBook Packages: Springer Book Archive