A heuristic method for solving integer-valued decompositional multiindex problems

被引:7
|
作者
Afraimovich, L. G. [1 ]
机构
[1] Nizhnii Novgorod State Univ, Nizhnii Novgorod, Russia
关键词
3-DIMENSIONAL ASSIGNMENT PROBLEMS; HIERARCHICAL SYSTEMS; ALGORITHM; APPROXIMATION; RESOURCE; MODEL;
D O I
10.1134/S0005117914080013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider NP-hard integer-valued multiindex problems of transportation type. We distinguish a subclass of polynomially solvable multiindex problems, namely multiindex problems with decomposition structure. We construct a general scheme for a heuristic method to solve a number of similar NP-hard decompositional multiindex problems. For one version of implementation for this scheme, we estimate its deviation from the optimum. We illustrate our results with the example of designing a class schedule.
引用
收藏
页码:1357 / 1368
页数:12
相关论文
共 50 条