Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Recoverable Robustness In Combinatorial Optimization PDF full book. Access full book title Recoverable Robustness In Combinatorial Optimization.
| Author | : Christina Büsing |
| Publisher | : |
| Total Pages | : 154 |
| Release | : 2011 |
| Genre | : Kombinatorische Optimierung / swd / (DE-101)040318265 / (DE-588c)4031826-6 |
| ISBN | : 9783869557717 |
| Author | : Michael Doumpos |
| Publisher | : Springer |
| Total Pages | : 321 |
| Release | : 2016-07-12 |
| Genre | : Business & Economics |
| ISBN | : 3319331213 |
This book provides a broad coverage of the recent advances in robustness analysis in decision aiding, optimization, and analytics. It offers a comprehensive illustration of the challenges that robustness raises in different operations research and management science (OR/MS) contexts and the methodologies proposed from multiple perspectives. Aside from covering recent methodological developments, this volume also features applications of robust techniques in engineering and management, thus illustrating the robustness issues raised in real-world problems and their resolution within advances in OR/MS methodologies. Robustness analysis seeks to address issues by promoting solutions, which are acceptable under a wide set of hypotheses, assumptions and estimates. In OR/MS, robustness has been mostly viewed in the context of optimization under uncertainty. Several scholars, however, have emphasized the multiple facets of robustness analysis in a broader OR/MS perspective that goes beyond the traditional framework, seeking to cover the decision support nature of OR/MS methodologies as well. As new challenges emerge in a “big-data'” era, where the information volume, speed of flow, and complexity increase rapidly, and analytics play a fundamental role for strategic and operational decision-making at a global level, robustness issues such as the ones covered in this book become more relevant than ever for providing sound decision support through more powerful analytic tools.
| Author | : Boting Yang |
| Publisher | : Springer |
| Total Pages | : 491 |
| Release | : 2008-08-20 |
| Genre | : Computers |
| ISBN | : 354085097X |
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 submissions. The papers feature original research in the areas of combinatorial optimization -- both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
| Author | : Ding-Zhu Du |
| Publisher | : Springer |
| Total Pages | : 554 |
| Release | : 2009-06-18 |
| Genre | : Computers |
| ISBN | : 3642020267 |
This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009. The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
| Author | : Marc Goerigk |
| Publisher | : Springer |
| Total Pages | : 0 |
| Release | : 2024-08-03 |
| Genre | : Business & Economics |
| ISBN | : 9783031612602 |
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.
| Author | : Mourad Baïou |
| Publisher | : Springer Nature |
| Total Pages | : 302 |
| Release | : 2020-07-22 |
| Genre | : Computers |
| ISBN | : 3030532623 |
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 24 revised full papers presented in this book were carefully reviewed and selected from 66 submissions.They were organized in the following topical sections: polyhedral combinatorics; integer programming; scheduling; matching; Network Design; Heuristics.
| Author | : Ravindra K. Ahuja |
| Publisher | : Springer |
| Total Pages | : 439 |
| Release | : 2009-10-21 |
| Genre | : Computers |
| ISBN | : 364205465X |
Scheduled transportation networks give rise to very complex and large-scale networkoptimization problems requiring innovative solution techniques and ideas from mathematical optimization and theoretical computer science. Examples of scheduled transportation include bus, ferry, airline, and railway networks, with the latter being a prime application domain that provides a fair amount of the most complex and largest instances of such optimization problems. Scheduled transport optimization deals with planning and scheduling problems over several time horizons, and substantial progress has been made for strategic planning and scheduling problems in all transportation domains. This state-of-the-art survey presents the outcome of an open call for contributions asking for either research papers or state-of-the-art survey articles. We received 24 submissions that underwent two rounds of the standard peer-review process, out of which 18 were finally accepted for publication. The volume is organized in four parts: Robustness and Recoverability, Robust Timetabling and Route Planning, Robust Planning Under Scarce Resources, and Online Planning: Delay and Disruption Management.
| Author | : Greg N. Frederickson |
| Publisher | : |
| Total Pages | : 66 |
| Release | : 1998 |
| Genre | : Algorithms |
| ISBN | : |
Abstract: "The robustness function of an optimization problem measures the maximum change in the value of its optimal solution that can be produced by changes of a given total magnitude on the values of the elements in its input. The problem of computing the robustness function of matroid optimization problems is studied under two cost models: the discrete model, which allows the removal of elements from the input, and the continuous model, which permits finite changes on the values of the elements in the input. For the discrete model, an O(log k)-approximation algorithm is presented for computing the robustness function of minimum spanning trees, where k is the number of edges to be removed. The algorithm uses as key subroutine a 2-approximation algorithm for the problem of dividing a graph into the maximum number of components by removing k edges from it. For the continuous model, a number of results are presented. First, a general algorithm is given for computing the robustness function of any matroid. The algorithm runs in strongly polynomial time on matroids with a strongly polynomial time independence test. Faster algorithms are also presented for some particular classes of matroids: (1) an O(n3m2 log(n2/m))-time algorithm for graphic matroids, where m is the number of elements in the matroid and n is its rank, (2) an O(mn(m+n2)[absolute value of]E log(m2/[absolute value of]E + 2))-time algorithm for transversal matroids, where [absolute value of]E is a parameter of the matroid, (3) an O(m2n2)-time algorithm for scheduling matroids, and (4) an O(m log m)-time algorithm for partition matroids. For this last class of matroids an optimal algorithm is also presented for evaluating the robustness function at a single point."
| Author | : Stefan Helber |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 577 |
| Release | : 2013-11-27 |
| Genre | : Business & Economics |
| ISBN | : 3319007955 |
This book contains selected papers presented at the "International Annual Conference of the German Operations Research Society (OR2012)" which was held September 4 -7, 2012 at the Leibniz Universität Hannover, Germany. The international conference, which also serves as the annual meeting of the German Operations Research Society (GOR), attracted more than 500 participants from more than 39 countries. Special attention at the conference was given to the three topics "Energy, Markets and Mobility". The OR2012 conference has addressed these topics from an OR perspective, treating them not only in isolation, but also with respect to their numerous and exciting interconnections, such as new energy for new mobility concepts and new market mechanisms for sustainable energy production to name but a few. The proceedings show that this conference topic is an important and promising area to apply Operations Research. The book also contains numerous papers addressing the full scope of fields in Operations Research.
| Author | : Yingshu Li |
| Publisher | : Springer Nature |
| Total Pages | : 625 |
| Release | : 2019-12-06 |
| Genre | : Computers |
| ISBN | : 3030364127 |
This volume constitutes the proceedings of the 13th International Conference on Combinatorial Optimization and Applications, COCOA 2019, held in Xiamen, China, in December 2019. The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design and analysis, information and coding theory for wireless networks, localization, mobile cloud computing, topology control and coverage, security and privacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middleware support, and experimental test-beds, models and case studies.
