Pages that link to "Item:Q3649157"
From MaRDI portal
The following pages link to The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications (Q3649157):
Displayed 18 items.
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- Integration of turnaround and aircraft recovery to mitigate delay propagation in airline networks (Q2669705) (← links)
- Delay-Robust Event Scheduling (Q2875596) (← links)
- Recoverable robust shortest path problems (Q2892155) (← links)
- Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results (Q2967619) (← links)
- Γ-robust linear complementarity problems (Q5038437) (← links)
- (Q5091241) (← links)
- A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization (Q5131477) (← links)
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts (Q5964853) (← links)
- \(\Gamma\)-robust optimization of project scheduling problems (Q6065662) (← links)
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs (Q6116027) (← links)
- Minimizing recovery cost of network optimization problems (Q6179707) (← links)
- On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)