On the robust assignment problem under a fixed number of cost scenarios

被引：19

作者：

Deineko, VG

Woeginger, GJ ^{[1
]}

机构：

[1] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England

[2] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

来源：

OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 02期

关键词：

assignment problem; computational complexity; robust optimization;

D O I：

10.1016/j.orl.2005.04.003

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. We prove that this problem is polynomial-time equivalent to the exact perfect matching problem in bipartite graphs. an infamous combinatorial optimization problem of unknown computational complexity. (c) 2005 Published by Elsevier B.V.

引用

页码：175 / 179

页数：5

共 8 条

[1]

AISSI H, 2005, IN PRESS OPER RES LE

[2] EXACT ARBORESCENCES, MATCHINGS AND CYCLES [J].