A heuristic method for solving integer-valued decompositional multiindex problems

被引:0
|
作者
L. G. Afraimovich
机构
[1] Nizhni Novgorod State University,
来源
关键词
Remote Control; Assignment Problem; Admissible Solution; Decomposition Structure; Class Schedule;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:11
相关论文
共 50 条