Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty

Marc Goerigk (), Adam Kasperski and Paweł Zieliński ()
Additional contact information
Marc Goerigk: University of Siegen
Paweł Zieliński: Wrocław University of Science and Technology

A chapter in Operations Research Proceedings 2019, 2020, pp 423-429 from Springer

Abstract: Abstract In this paper a class of robust two-stage combinatorial optimization problems with uncertain costs is discussed. It is assumed that the uncertainty is modeled by using a convex uncertainty set, for example of polyhedral or ellipsoidal shape. Several methods to compute exact and approximate solutions are introduced. Experimental results for robust two-stage version of the weighted set cover problem are presented.

Keywords: Robust optimization; Two-stage approach; Convex uncertainty; Combinatorial optimization (search for similar items in EconPapers)
Date: 2020
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-030-48439-2_51

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

DOI: 10.1007/978-3-030-48439-2_51

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 ().