Complexity of Solutions Combination for the Three-Index Axial Assignment Problem

Complexity of Solutions Combination for the Three-Index Axial Assignment Problem

In this work we consider the NP-hard three-index axial assignment problem. We formulate and investigate a problem of combining feasible solutions. Such combination can be applied in a wide range of heuristic and approximate algorithms for solving the assignment problem, instead of the commonly used...

Full description

Bibliographic Details
Main Authors: Lev G. Afraimovich, Maxim D. Emelin
Format: Article
Language:English
Published: MDPI AG 2022-03-01
Series:Mathematics
Subjects:
axial assignment problem
multi-index problem
approximate algorithms
NP-hardness
Online Access:https://www.mdpi.com/2227-7390/10/7/1062

Similar Items

Similar Items