Pages that link to "Item:Q2197489"
From MaRDI portal
The following pages link to Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489):
Displaying 7 items.
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem (Q6164623) (← links)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context (Q6559404) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
