Skip to main content
SpringerLink
Log in

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

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

Abstract

We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.

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

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

    Article  Google Scholar 

Download references

Acknowledgments

I. Ljubić is supported by the APART Fellowship of the Austrian Academy of Sciences. This support is greatly acknowledged. E. Álvarez-Miranda thanks the Institute of Advanced Studies of the Università di Bologna from where he is a PhD Fellow.

Author information

Authors and Affiliations

  1. DEI, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Eduardo Álvarez-Miranda & Paolo Toth

  2. Department of Statistics and Operations Research, Faculty of Business, Economics, and Statistics, University of Vienna, Brünnerstraße 72, 1210, Vienna, Austria

    Ivana Ljubić

Authors
  1. Eduardo Álvarez-Miranda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivana Ljubić
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivana Ljubić.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Álvarez-Miranda, E., Ljubić, I. & Toth, P. A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR-Q J Oper Res 11, 349–360 (2013). https://doi.org/10.1007/s10288-013-0231-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-013-0231-6

Keywords

Mathematics Subject Classification

Search

Navigation