Pages that link to "Item:Q526823"

The following pages link to Min-max-min robust combinatorial optimization (Q526823):

Displaying 21 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
• \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty (Q1740549) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
• A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
• Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← 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 double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem (Q6164623) (← links)
• A framework for inherently interpretable optimization models (Q6168581) (← links)
• On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
• An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)