Overview
- Provides a comprehensive overview of basic results and state-of-the-art knowledge on robust combinatorial optimization
- Contains numerous examples and exercises with solutions
- Includes a collection of open problems in the field
Part of the book series: International Series in Operations Research & Management Science (ISOR, volume 361)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Keywords
Table of contents (11 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
About the authors
Marc Goerigk is a Professor and Chair of Business Decisions and Data Science at the University of Passau, Germany. He has previously held positions at the Universities of Siegen, Lancaster (UK), Kaiserslautern, and Göttingen, where he pursued his studies in mathematics. Marc has a keen interest in optimization under uncertainty.
Michael Hartisch currently serves as a temporary professor of Analytics & Mixed-Integer Optimization at Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany. Prior to this role, he was acting chair of Network and Data Science Management at the University of Siegen, Germany. His academic journey began with studies in mathematics at Friedrich Schiller University Jena, Germany. Michael’s primary focus is on optimization under uncertainty.
Bibliographic Information
Book Title: An Introduction to Robust Combinatorial Optimization
Book Subtitle: Concepts, Models and Algorithms for Decision Making under Uncertainty
Authors: Marc Goerigk, Michael Hartisch
Series Title: International Series in Operations Research & Management Science
DOI: https://doi.org/10.1007/978-3-031-61261-9
Publisher: Springer Cham
eBook Packages: Business and Management, Business and Management (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2024
Hardcover ISBN: 978-3-031-61260-2Published: 23 August 2024
Softcover ISBN: 978-3-031-61263-3Due: 06 September 2025
eBook ISBN: 978-3-031-61261-9Published: 22 August 2024
Series ISSN: 0884-8289
Series E-ISSN: 2214-7934
Edition Number: 1
Number of Pages: XII, 308
Number of Illustrations: 87 b/w illustrations
Topics: Operations Research/Decision Theory, Discrete Optimization, Operations Research, Management Science