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

作者：Lee Taehan; Kwon Changhyun^*

来源：4OR-A Quarterly Journal of Operations Research, 2014, 12(4): 373-378.

DOI：10.1007/s10288-014-0270-7

• Robust combinatorial optimization
• Discrete optimization

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.

• 出版日期2014-12