The following pages link to KAdaptabilitySolver (Q45607):
Displaying 12 items.
- (Q49601) (redirect page) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← 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)
- 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)
- Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization (Q4995078) (← 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)
- A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization (Q5131477) (← links)
