Recoverable Robustness In Combinatorial Optimization


Recoverable Robustness In Combinatorial Optimization
DOWNLOAD

Download Recoverable Robustness In Combinatorial Optimization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Recoverable Robustness In Combinatorial Optimization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page





Recoverable Robustness In Combinatorial Optimization


Recoverable Robustness In Combinatorial Optimization
DOWNLOAD

Author : Christina Büsing
language : en
Publisher:
Release Date : 2011

Recoverable Robustness In Combinatorial Optimization written by Christina Büsing and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2011 with Kombinatorische Optimierung / swd / (DE-101)040318265 / (DE-588c)4031826-6 categories.




An Introduction To Robust Combinatorial Optimization


An Introduction To Robust Combinatorial Optimization
DOWNLOAD

Author : Marc Goerigk
language : en
Publisher: Springer
Release Date : 2024-08-03

An Introduction To Robust Combinatorial Optimization written by Marc Goerigk and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2024-08-03 with Business & Economics categories.


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.



Robustness Analysis In Decision Aiding Optimization And Analytics


Robustness Analysis In Decision Aiding Optimization And Analytics
DOWNLOAD

Author : Michael Doumpos
language : en
Publisher: Springer
Release Date : 2016-07-12

Robustness Analysis In Decision Aiding Optimization And Analytics written by Michael Doumpos and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016-07-12 with Business & Economics categories.


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.



Combinatorial Optimization And Applications


Combinatorial Optimization And Applications
DOWNLOAD

Author : Ding-Zhu Du
language : en
Publisher: Springer
Release Date : 2009-06-18

Combinatorial Optimization And Applications written by Ding-Zhu Du and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2009-06-18 with Computers categories.


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.



Combinatorial Optimization And Applications


Combinatorial Optimization And Applications
DOWNLOAD

Author : Boting Yang
language : en
Publisher: Springer Science & Business Media
Release Date : 2008-08-04

Combinatorial Optimization And Applications written by Boting Yang and has been published by Springer Science & Business Media this book supported file pdf, txt, epub, kindle and other format this book has been release on 2008-08-04 with Computers categories.


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.



Robust And Online Large Scale Optimization


Robust And Online Large Scale Optimization
DOWNLOAD

Author : Ravindra K. Ahuja
language : en
Publisher: Springer
Release Date : 2009-10-21

Robust And Online Large Scale Optimization written by Ravindra K. Ahuja and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2009-10-21 with Computers categories.


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.



Combinatorial Optimization


Combinatorial Optimization
DOWNLOAD

Author : Mourad Baïou
language : en
Publisher: Springer Nature
Release Date : 2020-07-22

Combinatorial Optimization written by Mourad Baïou and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020-07-22 with Computers categories.


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.



Robustness Concepts For Knapsack And Network Design Problems Under Data Uncertainty


Robustness Concepts For Knapsack And Network Design Problems Under Data Uncertainty
DOWNLOAD

Author : Manuel Kutschka
language : en
Publisher: Cuvillier Verlag
Release Date : 2013-12-16

Robustness Concepts For Knapsack And Network Design Problems Under Data Uncertainty written by Manuel Kutschka and has been published by Cuvillier Verlag this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013-12-16 with Mathematics categories.


This thesis is concerned with mathematical optimization under data uncertainty using mixed integer linear programming (MILP) techniques. Our investigations follow the deterministic paradigm known as robust optimization. It allows to tackle an uncertain variant of a problem without increasing its complexity in theory or decreasing its computational tractability in practice. We consider four robustness concepts for robust optimization and describe their parametrization, application, and evaluation. The concepts are Γ-robustness, its generalization multi-band robustness, the more general submodular robustness, and the two-staged adaptive approach called recoverable robustness. For each concept, we investigate the corresponding robust generalization of the knapsack problem (KP), a fundamental combinatorial problem and subproblem of almost every integer linear programming (ILP) problem, and many other optimization problems. We present ILP formulations, detailed polyhedral investigations including new classes of valid inequalities, and algorithms for each robust KP. In particular, our results for the submodular and recoverable robust KP are novel. Additionally, the recoverable robust KP is experimentally evaluated in detail. Further, we consider the Γ-robust generalization of the capacitated network design problem (NDP). For example, the NDP arises from many application areas such as telecommunications, transportation, or logistics. We present MILP formulations, detailed polyhedral insights with new classes of valid inequalities, and algorithms for the Γ-robustness NDP. Moreover, we consider the multi-band robust NDP, its MILP formulations, and generalized polyhedral results of the Γ- robustness NDP. Finally, we present computational results for the Γ-robustness NDP using real-world measured uncertain data from telecommunication networks. These detailed representative studies are based on our work with the German ROBUKOM project in cooperation with Partner Nokia Siemens Networks GmbH & Co. KG. Die vorliegende Dissertation untersucht mathematische Optimierung unter Unsicherheiten mittels Methoden der gemischt-ganzzahligen linearen Programmierung (MILP). Dabei folgen wir dem deterministischen Paradigma der robusten Optimierung. Dieses ermöglicht die Lösung unsicherer Problemvarianten ohne Erhöhung der theoretischen Komplexität oder Verschlechterung der praktischen Lösbarkeit. Wir untersuchen vier Robustheitskonzepte und beschreiben deren Parametrisierung, Anwendung, und Evaluierung. Die untersuchten Konzepte sind Γ-Robustheit (engl. Γ-robustness), deren neue Verallgemeinerung Multi-Band-Robustheit (engl. multi-band robustness), die neue allgemeinere submodulare Robustheit (engl. submodular robustness), sowie der adaptive zweistufige Ansatz der wiederherstellbaren Robustheit (engl. recoverable robustness) Für jedes Konzept untersuchen wir die entsprechende robuste Verallgemeinerung des Rucksackproblems (engl. knapsack problem) (KP), eines der fundamentalen kombinatorischen Probleme und Teilproblem fast jeden Problems der ganzzahligen linearen Programmierung (ILP) und vieler anderer Optimierungsprobleme. Wir präsentieren ILP-Formulierungen, detaillierte polyedrische Studien mit neuen Klassen gültiger Ungleichungen und Algorithmen für jedes robuste KP. Dabei sind insbesondere unsere Ergebnisse für das submodular- und wiederherstellbar-robuste KP neuartig. Zusätzlich evaluieren wir das wiederherstellbar- robuste KP experimentell in einer detaillierten Rechenstudie. Außerdem betrachten wir die Γ-robuste Verallgemeinerung des kapazitierten Netzwerkplanungsproblems (engl. capacitated network design problem) (NDP). Das NDP ist z. B. in Anwendungsproblemen aus den Bereichen Telekommunikation, Transport oder Logistik zu finden. Für das Γ-robuste NDP präsentieren wir MILP-Formulierungen, detaillierte polyedrische Ergebnisse, neue Klassen gültiger Ungleichungen und Algorithmen. Zusätzlich untersuchen wir das Multi-Band-robuste NDP, dessen MILP-Formulierungen, sowie dessen polyedrische Struktur als Verallgemeinerung des Γ-robusten NDP. Abschließend präsentieren wir detaillierten Rechenstudien zum Γ-robusten NDP mit real gemessenen unsicheren Daten verschiedener Telekommunikationsnetze. Diese repräsentativen Rechenergebnisse basieren auf unserer Arbeit im Projekt ROBUKOM in Kooperation mit Nokia Siemens Networks GmbH & Co. KG.



Handbook Of Combinatorial Optimization 1


Handbook Of Combinatorial Optimization 1
DOWNLOAD

Author : Dingzhu Du
language : en
Publisher: Springer Science & Business Media
Release Date : 1998

Handbook Of Combinatorial Optimization 1 written by Dingzhu Du and has been published by Springer Science & Business Media this book supported file pdf, txt, epub, kindle and other format this book has been release on 1998 with Mathematics categories.


The first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems.



Analysis And Design Of Algorithms In Combinatorial Optimization


Analysis And Design Of Algorithms In Combinatorial Optimization
DOWNLOAD

Author : Giorgio Ausiello
language : en
Publisher: Springer
Release Date : 2014-05-04

Analysis And Design Of Algorithms In Combinatorial Optimization written by Giorgio Ausiello and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014-05-04 with Science categories.