A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty

被引：20

作者：

Lee, Taehan ^{[1
]}

Kwon, Changhyun ^{[2
]}

机构：

[1] Chonbuk Natl Univ, Dept Ind & Informat Syst Engn, Jeonju, South Korea

[2] SUNY Buffalo, Dept Ind & Syst Engn, Buffalo, NY 14260 USA

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2014年 / 12卷 / 04期

关键词：

Robust combinatorial optimization; Discrete optimization;

D O I：

10.1007/s10288-014-0270-7

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.

引用

页码：373 / 378

页数：6

共 4 条

[1] A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems [J].

Alvarez-Miranda, Eduardo ;

Ljubic, Ivana ;

Toth, Paolo .

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (04) :349-360

[2] Robust discrete optimization and network flows [J].

Bertsimas, D ;

Sim, M .

MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71

[3] Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients [J].

Kwon, Changhyun ;

Lee, Taehan ;

Berglund, Paul .

NAVAL RESEARCH LOGISTICS, 2013, 60 (05) :375-394

[4]

Park Kyungchul, 2007, Management Science & Financial Engineering, V13, P115

← 1 →