Robust 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 3 in An Introduction to Robust Combinatorial Optimization, 2024, pp 43-65 from Springer

Abstract: Abstract We define different concepts of robustness for combinatorial optimization problems and introduce models for scenario sets in this chapter. From an axiomatic perspective, there is not one “perfect” type of robustness. We also point out connections to multi-criteria optimization and the concept of efficient solutions.

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_3

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

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

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