Abstract
In this paper continuous forms of the transportation problem and the assignment problem are formulated and discussed. An algorithm for the solution of the continuous assignment problem is described. This algorithm is a continuous analogue of the usual transportation algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, E.J., and A.B. Philpott: Duality and an algorithm for a class of continuous transportation problems, in preparation.
Appell, P.: Le problème géométrique des déblais et remblais, Memorial des Sciènces Mathématiques, 1928.
Kantorovitch, L.V.: On the translocation of masses, Doklady Akad. Nauk.SSSR, 37 (1942), 199–201.
Kretschmer, K.S.: Programmes in paired spaces, Canadian J. Math., 13 (1961), 323–334.
Levin, V.L. and A.A. Milyutin: The problem of mass transfer with a discontinuous cost function, Russian Math. Surveys, 34 (1978), 1–78.
Monge, G.: Mémoires de l’Académie des Sciences, 1781.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, E.J., Philpott, A.B. (1983). An Algorithm for a Continuous Version of the Assignment Problem. In: Fiacco, A.V., Kortanek, K.O. (eds) Semi-Infinite Programming and Applications. Lecture Notes in Economics and Mathematical Systems, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46477-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-46477-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12304-0
Online ISBN: 978-3-642-46477-5
eBook Packages: Springer Book Archive