Abstract
The paper presents a new polynomially bounded assignment algorithm, called the threshold assignment algorithm. The algorithm is based on a new theorem concerning label-correcting shortest path algorithms. Preliminary computational findings indicate that the threshold assignment algorithm is much faster than the primal simplex algorithm for solving assignment problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Barr, F. Glover and D. Klingman, “The alternating basis algorithm for assignment problems”, Mathematical Programming 13 (1977), 1–13.
R.G. Busacker and P.J. Gowen, “A procedure for determining a family of minimal cost network flow patterns”, ORO Technical Paper 15, Operations Research Office, The Johns Hopkins University (Baltimore, MD, 1961).
R.G. Busacker and T.L. Saaty, Finite graphs and networks: An introduction with applications (McGraw-Hill, New York, 1965).
E. Dinic and M. Kronrod, “An algorithm for the solution of the assignment problem”, Soviet Mathematics Doklady 10 (1969), 18–23.
J. Edmonds and R. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the Association for Computing Machinery 19 (1972) 248–264.
E. Egervary, “Matrixok Kombinatorius Tulafonsagairol”, Matematickai es Fizikai Lapok 38 (1931) 16–28.
M. Engquist, “A successive shortest path algorithm for the assignment problem”, INFOR 20 (1982) 370–384.
L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, NJ, 1962).
F. Glover, R. Glover and D. Klingman, “The threshold shortest path algorithm”, Networks 14(1) (1984).
F. Glover, D. Klingman and N. Phillips, “Partitioning shortest path algorithm”, Research Report, University of Texas (Austin, TX, 1982), 10 pp.
A. Gribov, “Recursive solution for the transportation problem of linear programming”, Vestnik of Leningrad University 33 (1978) 37–52 (in Russian).
M. Hung and W. Rom, “Solving the assignment problem by relaxation”, Operations Research 28 (1980) 969–982.
M. Hung and W. Rom, “Improved implementation of the relaxation algorithm for assignment problems”, presented at the ORSA/TIMS Houston, TX meeting, October 11–14, 1981.
E. Johnson, “Flows in networks”, in: S. Elmaghraby and J. Moder, eds., Handbook of Operations Research: Foundations and Fundamentals (Van Nostrand Reinhold Company, New York, 1979), pp. 271–296.
D. Klingman, A. Napier and J. Stutz, “NETGEN—A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems”, Management Science 20 (1974) 814–821.
D. König, Theorie der endlichen und unendlichen Graphen (Akademie Verlag, Leipzig, 1936).
H.W. Kuhn, “The Hungarian method for the assignment problem”, Naval Research Logistics Quarterly 2 (1955) 83–97.
A. Weintraub and F. Barahona, “A dual algorithm for the assignment problem”, Publication No. 79/02/C, Departmento de Industrias, Universidad de Chile-Sede Occidente (Santiago, Chile, 1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Glover, F., Glover, R., Klingman, D. (1986). Threshold assignment algorithm. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121086
Download citation
DOI: https://doi.org/10.1007/BFb0121086
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive