Pages that link to "Item:Q2312326"
From MaRDI portal
The following pages link to Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326):
Displaying 19 items.
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
- Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← 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)
- An active set algorithm for robust combinatorial optimization based on separation oracles (Q5919428) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
- A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem (Q6164623) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
