Pages that link to "Item:Q526823"
From MaRDI portal
The following pages link to Min-max-min robust combinatorial optimization (Q526823):
Displaying 36 items.
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- On combined minmax-minsum optimization (Q1333027) (← 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)
- Solving robust two-stage combinatorial optimization problems under convex uncertainty (Q2050273) (← links)
- \(K\)-adaptability in stochastic optimization (Q2097652) (← 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)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty (Q2257099) (← 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)
- (Q3330973) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- Thresholded Covering Algorithms for Robust and Max-min Optimization (Q3587385) (← links)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207) (← 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)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← 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)
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)
