Pages that link to "Item:Q2410249"

The following pages link to Robust recoverable and two-stage selection problems (Q2410249):

Displaying 17 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
• A linear time algorithm for the robust recoverable selection problem (Q1983118) (← links)
• Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection (Q2139143) (← links)
• Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
• Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
• Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)
• Mid-term capacity redeployment of Rescue Centers under simultaneous requirements (Q5889181) (← links)
• Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
• On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)