The constrained minimax linear assignment problem

被引：2
|
作者：
Charnsethikul, P
机构：
[1] Kasetsart Univ, Dept Ind Engn, Operat Res Unit, Bangkok, Thailand
[2] Kasetsart Univ, Dept Ind Engn, Management Sci Unit, Bangkok, Thailand
来源：
OPTIMIZATION METHODS & SOFTWARE | 2000年 / 14卷 / 1-2期
关键词：
combinatorial optimization; polynomial time algorithm; branch and bound method;
D O I：
10.1080/10556780008805792
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The minimax linear assignment problem with additional linear constraints is studied. An exact polynomial time algorithm is developed, verified and validated in case of a single added constraint. In case of multiple constraints, the problem is more complex and becomes NP-hard. A tree search technique is proposed. Some computational studies are reported.
引用
收藏
页码：37 / 48
页数：12
相关论文
共 50 条
12345