Abstract
The paper proposes a new method to solve the assignment problem based on recursive derivation of the optimal solution. The assignment problem is formulated in the rearrangement matrix form that allows the use of the matrix approach to optimal solution. The algorithm is to find the minimum total weight matching in the bipartite graph with 2n vertices. The computational scheme of the recurrence method for solving the assignment problem is presented in the form adapted for implementation on a computer.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. H. Papadimtriou and K. Steiglitz, Combinatorial optimization: Algorithms and Complexity, Dover Books on Computer Science, Dover Publ. (1998).
A. Yu. Levchenko, A. V. Morozov, and A. V. Panishev, “Fast algorithm of solving the assignment problem to find the lower bound of a traveling salesman route cost,” Iskusstv. Intellekt, Issue 4, 406–416 (2011).
A. Yu. Levchenko, A. V. Morozov, and A. V. Panishev, “A mechanism to accelerate the evaluations in the Little method of the solution of traveling salesman problems,” Iskusstv. Intellekt, Issue 2, 95–110 (2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2015, pp. 119–127.
Rights and permissions
About this article
Cite this article
Matsiy, O.B., Morozov, A.V. & Panishev, A.V. The Recurrent Method to Solve the Assignment Problem. Cybern Syst Anal 51, 939–946 (2015). https://doi.org/10.1007/s10559-015-9786-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9786-x