000 03599nam a22005775i 4500
001 978-3-031-61261-9
003 DE-He213
005 20251030112907.0
007 cr nn 008mamaa
008 240823s2024 sz | s |||| 0|eng d
020 _a9783031612619
_9978-3-031-61261-9
024 7 _a10.1007/978-3-031-61261-9
_2doi
050 4 _aT57.6-.97
072 7 _aKJT
_2bicssc
072 7 _aKJMD
_2bicssc
072 7 _aBUS049000
_2bisacsh
072 7 _aKJT
_2thema
072 7 _aKJMD
_2thema
100 1 _aGoerigk, Marc.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982761
245 1 3 _aAn Introduction to Robust Combinatorial Optimization
_h[electronic resource] :
_bConcepts, Models and Algorithms for Decision Making under Uncertainty /
_cby Marc Goerigk, Michael Hartisch.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXII, 308 p. 87 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInternational Series in Operations Research & Management Science,
_x2214-7934 ;
_v361
505 0 _a1. 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.
520 _aThis 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.
650 0 _aOperations research.
_957943
650 0 _aMathematical optimization.
_965522
650 0 _aManagement science.
_957941
650 1 4 _aOperations Research and Decision Theory.
_967143
650 2 4 _aDiscrete Optimization.
_973079
650 2 4 _aOperations Research, Management Science.
_965527
700 1 _aHartisch, Michael.
_eauthor.
_0(orcid)0000-0001-6304-4973
_1https://orcid.org/0000-0001-6304-4973
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_971797
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031612602
776 0 8 _iPrinted edition:
_z9783031612626
776 0 8 _iPrinted edition:
_z9783031612633
830 0 _aInternational Series in Operations Research & Management Science,
_x2214-7934 ;
_v361
_969480
856 4 0 _uhttps://doi.org/10.1007/978-3-031-61261-9
912 _aZDB-2-BUM
912 _aZDB-2-SXBM
999 _c62665
_d62665