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

Abstract

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.

This is a preview of subscription content, access via your institution.

References

  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–360

    Article  Google Scholar 

  2. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1):49–71

    Article  Google 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–394

    Article  Google Scholar 

  4. Park K, Lee K (2007) A note on robust combinatorial optimization problem. Int J Manag Sci 13(1):115–119

    Google Scholar 

Download references

Acknowledgments

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

Author information

Affiliations

Authors

Corresponding author

Correspondence to Changhyun Kwon.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Lee, T., Kwon, C. A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR-Q J Oper Res 12, 373–378 (2014). https://doi.org/10.1007/s10288-014-0270-7

Download citation

Keywords

  • Robust combinatorial optimization
  • Discrete optimization

Mathematics Subject Classification

  • 90C11
  • 90C27