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.
KeywordsRobust combinatorial optimization Discrete optimization
Mathematics Subject Classification90C11 90C27
The first author’s research was supported by research funds of Chonbuk National University in 2013.
- Park K, Lee K (2007) A note on robust combinatorial optimization problem. Int J Manag Sci 13(1):115–119Google Scholar