Skip to main content
SpringerLink
Log in

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

  • Research paper
  • Published:
4OR Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Á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 

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

    Article  Google Scholar 

  • 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 

  • 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

Authors and Affiliations

  1. Department of Industrial and Information Systems Engineering, Chonbuk National University, Jeonju, Korea

    Taehan Lee

  2. Department of Industrial and Systems Engineering, University at Buffalo, SUNY, Buffalo, NY, USA

    Changhyun Kwon

Authors
  1. Taehan Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changhyun Kwon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changhyun Kwon.

Rights and permissions

Reprints and permissions

About this article

Check for updates. 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

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-014-0270-7

Keywords

Mathematics Subject Classification

Search

Navigation