Robust Two-Stage Network Problems

Adam Kasperski and Paweł Zieliński ()
Additional contact information
Paweł Zieliński: Wrocław University of Technology

A chapter in Operations Research Proceedings 2015, 2017, pp 35-40 from Springer

Abstract: 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.

Keywords: Network Optimization Problems; Cost Scenarios; Second-stage Cost; Interval Uncertainty Representation; Representatives Selection Problem (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-42902-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319429021

DOI: 10.1007/978-3-319-42902-1_5

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().