Pages that link to "Item:Q5106418"

The following pages link to Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418):

Displaying 2 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)