TY  - BOOK
AU  - Goerigk,Marc
AU  - Hartisch,Michael
ED  - SpringerLink (Online service)
TI  - An Introduction to Robust Combinatorial Optimization: Concepts, Models and Algorithms for Decision Making under Uncertainty 
T2  - International Series in Operations Research & Management Science,
SN  - 9783031612619
AV  - T57.6-.97 
PY  - 2024///
CY  - Cham
PB  - Springer Nature Switzerland, Imprint: Springer
KW  - Operations research
KW  - Mathematical optimization
KW  - Management science
KW  - Operations Research and Decision Theory
KW  - Discrete Optimization
KW  - Operations Research, Management Science
N1  - 1. Introduction -- 2. Basic Concepts -- 3. Robust Problems -- 4. General Reformulation Results -- 5. General Solution Methods -- 6. Robust election Problems -- 7. Robust Shortest Path Problems -- 8. Robust Spanning Tree Problems -- 9. Other Combinatorial Problems -- 10. Other Models for Robust Optimization -- 11. Open Problems
N2  - This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization paradigms. It begins by introducing readers to general results for interval, discrete, and budgeted uncertainty sets, and subsequently provides a comprehensive examination of specific combinatorial problems, including the selection, shortest path, spanning tree, assignment, knapsack, and traveling salesperson problems. The book equips both students and newcomers to the field with a grasp of the fundamental questions and ongoing advancements in robust optimization. Based on the authors’ years of teaching and refining numerous courses, it not only offers essential tools but also highlights the open questions that define this subject area
UR  - https://doi.org/10.1007/978-3-031-61261-9
ER  -