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

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.

Saved in:
Bibliographic Details
Published in4OR Vol. 12; no. 4; pp. 373 - 378
Main Authors Lee, Taehan, Kwon, Changhyun
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2014
Springer Nature B.V
Subjects
Business and Management
Combinatorial analysis
Industrial and Production Engineering
Operations research
Operations Research/Decision Theory
Optimization
Research Paper
Robustness
Systems engineering
Uncertainty
Discrete optimization
Robust combinatorial optimization
90C27
90C11
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1619-4500
1614-2411
DOI:10.1007/s10288-014-0270-7