|
This article is cited in 6 scientific papers (total in 6 papers)
Optimization, System Analysis, and Operations Research
Combining solutions of the axial assignment problem
L. G. Afraimovich, M. D. Emelin Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, 603950 Russia
Abstract:
We consider the NP-hard integer three-index axial assignment problem. The task of optimal combination of the pairs of feasible solutions of the problem is posed, and a linear complexity algorithm for its solution is constructed. This algorithm can be used as a supplement to heuristic or approximate algorithms for the three-index assignment problem for post-processing the obtained approximate solutions of the problem. The results of computational experiments, which demonstrate the promising nature of our approach, are presented.
Keywords:
axial assignment problem, multiindex problems, approximate algorithms.
Citation:
L. G. Afraimovich, M. D. Emelin, “Combining solutions of the axial assignment problem”, Avtomat. i Telemekh., 2021, no. 8, 159–168; Autom. Remote Control, 82:8 (2021), 1418–1425
Linking options:
https://www.mathnet.ru/eng/at15600 https://www.mathnet.ru/eng/at/y2021/i8/p159
|
Statistics & downloads: |
Abstract page: | 136 | Full-text PDF : | 13 | References: | 22 | First page: | 12 |
|