Pages that link to "Item:Q2195680"

The following pages link to \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680):

Displaying 20 items.

• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• On the performance of affine policies for two-stage adaptive optimization: a geometric perspective (Q747776) (← links)
• The decision rule approach to optimization under uncertainty: methodology and applications (Q2010368) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
• \(K\)-adaptability in stochastic optimization (Q2097652) (← links)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• Frameworks and results in distributionally robust optimization (Q2165596) (← links)
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← 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)
• Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← 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)
• A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data (Q6555144) (← links)
• Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
• A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization (Q6568949) (← links)
• Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)