Pages that link to "Item:Q5106418"
From MaRDI portal
The following pages link to Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418):
Displaying 4 items.
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem (Q6164623) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
