, Volume 12, Issue 4, pp 373–378 | Cite as

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

  • Taehan Lee
  • Changhyun Kwon
Research paper


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.


Robust combinatorial optimization Discrete optimization 

Mathematics Subject Classification

90C11 90C27 



The first author’s research was supported by research funds of Chonbuk National University in 2013.


  1. Álvarez-Miranda E, Ljubić I, Toth P (2013) A note on the bertsimas and sim algorithm for robust combinatorial optimization problems. 4OR 11(4):349–360CrossRefGoogle Scholar
  2. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1):49–71CrossRefGoogle Scholar
  3. Kwon C, Lee T, Berglund P (2013) Robust shortest path problems with two uncertain multiplicative cost coefficients. Nav Res Logist 60(5):375–394CrossRefGoogle Scholar
  4. Park K, Lee K (2007) A note on robust combinatorial optimization problem. Int J Manag Sci 13(1):115–119Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Industrial and Information Systems EngineeringChonbuk National UniversityJeonjuKorea
  2. 2.Department of Industrial and Systems EngineeringUniversity at Buffalo, SUNYBuffaloUSA

Personalised recommendations