Pages that link to "Item:Q3649157"

The following pages link to The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications (Q3649157):

Displayed 50 items.

• Robust optimization for routing problems on trees (Q301384) ‎ (← links)
• Finding robust timetables for project presentations of student teams (Q320999) ‎ (← links)
• Decomposition approaches for recoverable robust optimization problems (Q322768) ‎ (← links)
• Robust storage loading problems with stacking and payload constraints (Q323109) ‎ (← links)
• Rapid transit network design considering risk aversion (Q325376) ‎ (← links)
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) ‎ (← links)
• On the recoverable robust traveling salesman problem (Q331985) ‎ (← links)
• Recoverable robust single day aircraft maintenance routing problem (Q337121) ‎ (← links)
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) ‎ (← links)
• Robust flows with losses and improvability in evacuation planning (Q339930) ‎ (← links)
• Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances (Q454883) ‎ (← links)
• Generalized light robustness and the trade-off between robustness and nominal quality (Q471020) ‎ (← links)
• Robust load planning of trains in intermodal transportation (Q480756) ‎ (← links)
• A robust bus evacuation model with delayed scenario information (Q480774) ‎ (← links)
• Min-max-min robust combinatorial optimization (Q526823) ‎ (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) ‎ (← links)
• Recoverable robust knapsacks: the discrete scenario case (Q691430) ‎ (← links)
• Robust resource allocations in temporal networks (Q715076) ‎ (← links)
• On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem (Q724143) ‎ (← links)
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) ‎ (← links)
• MIP-based approaches for robust storage loading problems with stacking constraints (Q1652064) ‎ (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) ‎ (← links)
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) ‎ (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) ‎ (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) ‎ (← links)
• On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) ‎ (← links)
• Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) ‎ (← links)
• Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) ‎ (← links)
• Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market (Q1744521) ‎ (← links)
• Robust optimization in the presence of uncertainty: a generic approach (Q1745727) ‎ (← links)
• Optimal allocation of buffer times to increase train schedule robustness (Q1752165) ‎ (← links)
• An analytical approach to the protection planning of a rail intermodal terminal network (Q1752835) ‎ (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) ‎ (← links)
• A survey on robustness in railway planning (Q1754050) ‎ (← links)
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) ‎ (← links)
• Nominal and robust train timetabling problems (Q1926692) ‎ (← links)
• A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) ‎ (← links)
• The decision rule approach to optimization under uncertainty: methodology and applications (Q2010368) ‎ (← links)
• Improving the robustness in railway station areas (Q2256230) ‎ (← links)
• Recent advances in robust optimization: an overview (Q2256312) ‎ (← links)
• Timetabling with passenger routing (Q2260893) ‎ (← links)
• The relationship between multi-objective robustness concepts and set-valued optimization (Q2264185) ‎ (← links)
• The proactive and reactive resource-constrained project scheduling problem (Q2281615) ‎ (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) ‎ (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) ‎ (← links)
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) ‎ (← links)
• An application of deterministic and robust optimization in the wood cutting industry (Q2342918) ‎ (← links)
• The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) ‎ (← links)
• A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty (Q2398429) ‎ (← links)
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) ‎ (← links)