Skip to main content
SpringerLink
Log in

Robust Two-Stage Network Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2015

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

Abstract

In this paper a class of network optimization problems is discussed. It is assumed that a partial solution can be formed in the first stage, when the arc costs are precisely known, and completed optimally in the second stage, after a true second-stage cost scenario occurs. The robust min-max criterion is used to compute an optimal solution. Several complexity results for the interval and discrete uncertainty representations are provided.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Atamturk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55, 662–673 (2007)

    Article  Google Scholar 

  2. Bar-Noy, A., Khuller, A.S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD (1995)

    Google Scholar 

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

    Article  Google Scholar 

  4. Dhamdhere, K., Goya, V., Ravi, R., Singh, M.: How to pay, come what may: approximation algorithms for demand-robust covering problems. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 367–378 (2005)

    Google Scholar 

  5. Dolgui, A., Kovalev, S.: Min-max and min-max (relative) regret approaches to representatives selection problem. 4OR Q. J. Oper. Res. 10, 181–192 (2012)

    Article  Google Scholar 

  6. Kasperski, A., Zieliński, P.: On the approximability of robust spanning problems. Theor. Comput. Sci. 412, 365–374 (2011)

    Article  Google Scholar 

  7. Kasperski, A., Kurpisz, A., Zieliński, P.: Approximability of the robust representatives selection problem. Oper. Res. Lett. 43, 16–19 (2015)

    Article  Google Scholar 

  8. Katriel, I., Kenyon-Mathieu, C., Upfal, E.: Commitment under uncertainty: two-stage matching problems. Theor. Comput. Sci. 408, 213–223 (2008)

    Article  Google Scholar 

  9. Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Boston (1997)

    Book  Google Scholar 

  10. Lin, K.C., Chern, M.S.: The most vital edges in the minimum spanning tree problem. Inf. Process. Lett. 45, 25–31 (1993)

    Article  Google Scholar 

  11. Nasrabadi, E., Orlin, J.B.: Robust optimization with incremental recourse. CoRR (2013). arXiv:1312.4075

Download references

Acknowledgements

This work was partially supported by the National Center for Science (Narodowe Centrum Nauki), grant 2013/09/B/ST6/01525.

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Management, Wrocław University of Technology, Wrocław, Poland

    Adam Kasperski

  2. Faculty of Fundamental Problems of Technology, Wrocław University of Technology, Wrocław, Poland

    Paweł Zieliński

Authors
  1. Adam Kasperski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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. Department of Business Administration, University of Vienna, Vienna, Austria

    Karl Franz Dörner

  2. Decision Sciences and Statistics (IDS) Department, ESSEC Business School of Paris, Cergy Pontoise Cedex, France

    Ivana Ljubic

  3. Department of Statistics and Operations Research, University of Vienna, Vienna, Austria

    Georg Pflug

  4. Operations Research and Control Systems, TU Wien, Vienna, Austria

    Gernot Tragler

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Kasperski, A., Zieliński, P. (2017). Robust Two-Stage Network Problems. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_5

Download citation

Publish with us

Policies and ethics

Search

Navigation