Skip to main content
SpringerLink
Log in

Recoverable Robust Combinatorial Optimization Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2012

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results in this area.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max (regret) versions of cut problems. In: ISAAC 2005, Lecture Notes in Computer Science, vol. 3827, pp. 789–798. Springer-Verlag (2005).

    Google Scholar 

  2. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max and min-max regret assignment problems. Operation Research Letters 33, 634–640 (2005)

    Article  Google Scholar 

  3. Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming 90, 263–272 (2001)

    Article  Google Scholar 

  4. Büsing, C.: Recoverable robust shortest path problems. Networks 59, 181–189 (2012)

    Article  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H, Freeman and Company (1979)

    Google Scholar 

  6. Kasperski, A., Zieliński, P.: On the approximability of minmax (regret) network optimization problems. Information Processing Letters 109, 262–266 (2009)

    Article  Google Scholar 

  7. Kasperski, A., Zieliński, P.: On the approximability of robust spanning tree problems. Theoretical Computer Science 412, 365–374 (2011)

    Article  Google Scholar 

  8. Kasperski, A., Kurpisz, A., Zieliński, P.: Approximating the minmax (regret) selecting items problem. Information Processing Letters 113, 23–29 (2013)

    Article  Google Scholar 

  9. Kouvelis, P., Yu, G.: Robust Discrete Optimization and its applications. Kluwer Academic Publishers (1997).

    Google Scholar 

Download references

Acknowledgments

The third author of the paper was partially supported by Polish Committee for Scientific Research, grant N N206 492938.

Author information

Authors and Affiliations

  1. Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Adam Kasperski

  2. Faculty of Fundamental Problems of Technology, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Adam Kurpisz & Paweł Zieliński

Authors
  1. Adam Kasperski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Kurpisz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Zieliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Kasperski .

Editor information

Editors and Affiliations

  1. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Stefan Helber

  2. Institute for Information Systems Resear, Leibniz Universität Hannover, Hannover, Germany

    Michael Breitner

  3. Institute for Banking and Finance, Leibniz Universität Hannover, Hannover, Germany

    Daniel Rösch

  4. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Cornelia Schön

  5. Institute for Risk and Insurance, Leibniz Universität Hannover, Hannover, Germany

    Johann-Matthias Graf von der Schulenburg

  6. Institute of Statistics, Leibniz Universität Hannover, Hannover, Germany

    Philipp Sibbertsen

  7. Institute of Applied Mathematics, Leibniz Universität Hannover, Hannover, Germany

    Marc Steinbach

  8. Institute of Probability and Statistics, Leibniz Universität Hannover, Hannover, Germany

    Stefan Weber

  9. Institute of Production Management, Leibniz Universität Hannover, Hannover, Germany

    Anja Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kasperski, A., Kurpisz, A., Zieliński, P. (2014). Recoverable Robust Combinatorial Optimization Problems. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_22

Download citation

Publish with us

Policies and ethics

Search

Navigation