The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications

DOI10.1007/978-3-642-05465-5_1zbMath1266.90044OpenAlexW1636491287MaRDI QIDQ3649157

Marco E. Lübbecke, Rolf H. Möhring, Christian Liebchen, Sebastian Stiller

Publication date: 3 December 2009

Published in: Robust and Online Large-Scale Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-05465-5_1

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (80)

The recoverable robust spanning tree problem with interval costs is polynomially solvable ⋮ Γ-robust linear complementarity problems ⋮ Robust approach to restricted items selection problem ⋮ Recoverable robust shortest path problems ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Robust optimization for routing problems on trees ⋮ Finding robust timetables for project presentations of student teams ⋮ Decomposition approaches for recoverable robust optimization problems ⋮ Robust storage loading problems with stacking and payload constraints ⋮ Rapid transit network design considering risk aversion ⋮ Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions ⋮ On the recoverable robust traveling salesman problem ⋮ Recoverable robust single day aircraft maintenance routing problem ⋮ Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling ⋮ MIP-based approaches for robust storage loading problems with stacking constraints ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ Robust flows with losses and improvability in evacuation planning ⋮ A parameterized view to the robust recoverable base problem of matroids under structural uncertainty ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ Recoverable robust spanning tree problem under interval uncertainty representations ⋮ Robust recoverable and two-stage selection problems ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Integration of turnaround and aircraft recovery to mitigate delay propagation in airline networks ⋮ Nominal and robust train timetabling problems ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ \(\Gamma\)-robust optimization of project scheduling problems ⋮ Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs ⋮ Robust recoverable 0-1 optimization problems under polyhedral uncertainty ⋮ Minimizing recovery cost of network optimization problems ⋮ On the complexity of robust multi-stage problems with discrete recourse ⋮ Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results ⋮ Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances ⋮ A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Generalized light robustness and the trade-off between robustness and nominal quality ⋮ Robust load planning of trains in intermodal transportation ⋮ A robust bus evacuation model with delayed scenario information ⋮ Robust combinatorial optimization under budgeted-ellipsoidal uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ A linear time algorithm for the robust recoverable selection problem ⋮ Dominance-based linear formulation for the anchor-robust project scheduling problem ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ Robust optimization in the presence of uncertainty: a generic approach ⋮ A two-stage robust model for a reliable \(p\)-center facility location problem ⋮ Optimal allocation of buffer times to increase train schedule robustness ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ A survey on robustness in railway planning ⋮ Min-max-min robust combinatorial optimization ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ Improving the robustness in railway station areas ⋮ Recent advances in robust optimization: an overview ⋮ Timetabling with passenger routing ⋮ The decision rule approach to optimization under uncertainty: methodology and applications ⋮ The relationship between multi-objective robustness concepts and set-valued optimization ⋮ Robust resource allocations in temporal networks ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ Unnamed Item ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem ⋮ A decomposition approach for optimal gas network extension with a finite set of demand scenarios ⋮ The proactive and reactive resource-constrained project scheduling problem ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems ⋮ Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems ⋮ Approximate and robust bounded job start scheduling for Royal Mail delivery offices ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Recovery management for a dial-a-ride system with real-time disruptions ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ \(K\)-adaptability in stochastic optimization ⋮ An application of deterministic and robust optimization in the wood cutting industry ⋮ Delay-Robust Event Scheduling

This page was built for publication: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications