Robust Selection Problems

Marc Goerigk and Michael Hartisch
Additional contact information
Marc Goerigk: University of Passau
Michael Hartisch: Friedrich-Alexander-Universität Erlangen-Nürnberg

Chapter Chapter 6 in An Introduction to Robust Combinatorial Optimization, 2024, pp 137-182 from Springer

Abstract: Abstract Focussing on selection problems, we discuss the problem complexity and approximability for various combinations of decision criterion and uncertainty set. In particular, we show that there are some such combinations that result in a problem that can be solved in polynomial time.

Date: 2024
References: Add references at CitEc
Citations:

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:isochp:978-3-031-61261-9_6

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

DOI: 10.1007/978-3-031-61261-9_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().