Abstract
In this paper we present an algorithm for finding an optimum assignment for ann×n matrixM inn iterations. The method uses systematic permutations on the rows ofM and is based on the properties of optimum assignments. The implementation presented in the paper requires at mostO(n 3) in time andn 2+6n memory locations for solving a densen×n problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. W. Kuhn,The Hungarian method for the assignment problem, Naval Research Logist. Quarterly, Vol. 2, No. 1 & 2, 1955, pp. 83–97.
M. M. Flood,An alternate proof of a theorem of Koenig as an algorithm for the Hitchcock distribution problem, Proc. Symp. in Appl. Math., Vol. X, 1960, pp. 290–307.
J. Tiernan,A dual multiple resource assignment algorithm, Proceedings of the Seventh Hawaii International Conference on System Sciences, 1974, pp. 118–120.
K. G. Murthy,An algorithm for ranking all the assignments in order of increasing costs, Operations Research, 1968, pp. 682–687.
A. Weintraub,The shortest and k-shortest routes as assignment problems, Networks, Vol. 3, No. 1, 1973, pp. 61–73.
C. S. Orloff,A fundamental problem in vehicle routing, Networks 4, 1974, pp. 35–64.
J. Munkres,Algorithms for the assignment and transportation problems, J. Soc. Ind. Appl. Math., Vol. 5, No. 1 March 1957, pp. 32–38.
T. A. J. Nicholson,A sequential method for discrete optimization problem and its applications to the assignment, traveling salesman and three machine scheduling problems, J. Inst. Math. Applications, 1967, pp. 362–375.
H. M. Wagner,Principles of Operations Research with Applications to Management Decisions, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1969.
F. Glover, D. Karney, D. Klingman and A. Naper,A computational study on start procedures, basis change criteria and solution algorithms for transportation problems, Management Science, Vol. 20, 1974, pp. 793–814.
J. F. Desler and S. L. Hakimi,A graph theoretic approach to a class of integer programming problems, Operations Research, Vol. 17, 1969, pp. 1017–1033.
Y. Tabourier, Un algorithm pour le probleme d'affectation, Rev. Française Automat. Informat. Recherche Operationelle 6, Vol. 3, 1972, pp. 3–13.
N. Tomizawa,On some techniques useful for solution of transportation network problems, Networks, Vol. 1, No. 2, pp. 173–194.
J. Edmonds and R. Karp,Theoretical improvements in algorithmic efficiency for network flow problems, Journal ACM, Vol. 19, No. 2, pp. 248–264.
S. Dreyfus,An appraisal of some shortest path algorithms, Operations Research, Vol. 17, No. 3, May 1969, pp. 395–412.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Reading Mass., 1974.
D. B. Johnson,Finding all elementary circuits of a directed graph, SIAM J. Comput., Vol. 4, No. 1, March 1975, pp. 77–84.
B. Kinariwala and K. V. S. Bhat,Theory of output set assignments and the degree switching operations, SIAM J. Comput., Vol. 5, No. 4, 1976, pp. 589–601.
R. A. Wagner,A shortest path algorithm for edge sparse graphs, Proceedings of the Eighth Hawaii International Conference on System Sciences, Western Periodicals Company, 1975, pp. 256–258.
Author information
Authors and Affiliations
Additional information
This work was supported by the National Science Foundation Grant NSF ENG 74-19788.
Rights and permissions
About this article
Cite this article
Bhat, K.V.S., Kinariwala, B. An algorithm for then×n optimum assignment problem. BIT 19, 289–296 (1979). https://doi.org/10.1007/BF01930982
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01930982