RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2021 Issue 8, Pages 159–168 (Mi at15600)

This article is cited 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.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 05.11.2020
Revised: 11.01.2021
Accepted: 16.03.2021

DOI: 10.31857/S0005231021080080


 English version:
Automation and Remote Control, 2021, 82:8, 1418–1425

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024