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

被引：18
|
作者：
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
相关论文
共 50 条
  • [1] A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
    Taehan Lee
    Changhyun Kwon
    [J]. 4OR, 2014, 12 : 373 - 378
  • [2] Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
    Raith, Andrea
    Schmidt, Marie
    Schoebel, Anita
    Thom, Lisa
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (02) : 628 - 642
  • [3] On using cardinality constrained uncertainty for objective coefficients in robust optimization
    Lim, Jaeyoong
    Park, Sungsoo
    [J]. OPTIMIZATION LETTERS, 2021, 15 (04) : 1195 - 1214
  • [4] On using cardinality constrained uncertainty for objective coefficients in robust optimization
    Jaeyoong Lim
    Sungsoo Park
    [J]. Optimization Letters, 2021, 15 : 1195 - 1214
  • [5] Cardinality constrained combinatorial optimization: Complexity and polyhedra
    Stephan, Rudiger
    [J]. DISCRETE OPTIMIZATION, 2010, 7 (03) : 99 - 113
  • [6] A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
    Cui, Tianxiang
    Cheng, Shi
    Bai, Ruibin
    [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 491 - 498
  • [7] Robust combinatorial optimization problems under budgeted interdiction uncertainty
    Goerigk, Marc
    Khosravi, Mohammad
    [J]. OR SPECTRUM, 2024,
  • [8] A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
    Eduardo Álvarez-Miranda
    Ivana Ljubić
    Paolo Toth
    [J]. 4OR, 2013, 11 : 349 - 360
  • [9] A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
    Alvarez-Miranda, Eduardo
    Ljubic, Ivana
    Toth, Paolo
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (04): : 349 - 360
  • [10] Parameterized complexity of cardinality constrained optimization problems
    Cai, Leizhen
    [J]. Computer Journal, 2008, 51 (01): : 102 - 121
12345