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.

中文翻译：

---

轴向分配问题的组合解

摘要

我们考虑 NP-hard 整数三索引轴向分配问题。提出了问题的可行解对的最优组合任务，并构造了其解的线性复杂度算法。该算法可作为三指标分配问题的启发式或近似算法的补充，对得到的问题近似解进行后处理。计算实验的结果证明了我们方法的有前途的性质。