Minimizing recovery cost of network optimization problems
From MaRDI portal
Publication:6179707
DOI10.1002/net.22121zbMath1529.90078arXiv2110.11647MaRDI QIDQ6179707
Zacharie Ales, Sourour Elloumi
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11647
robust optimizationmixed integer linear programminguncertainty modelingrecoverable robustness\( \mathcal{N} \mathcal{P} \)-hardnessproactive problem
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05)
Cites Work
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Optimal lines for railway systems
- Adjustable robust solutions of uncertain linear programs
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- The construction of stable project baseline schedules
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- The complexity of machine scheduling for stability with a single disrupted job
- Robust Convex Optimization
- Recoverable robust shortest path problems
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Predictable scheduling of a single machine with breakdowns and sensitive jobs
- Robust and Adaptive Network Flows
- Provisioning a virtual private network
- Affine recourse for the robust network design problem: Between static and dynamic routing
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Minimizing recovery cost of network optimization problems
