Pages that link to "Item:Q325382"

The following pages link to Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382):

Displaying 20 items.

• Min-max-min robust combinatorial optimization (Q526823) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← 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)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
• On minimax robustness: A general approach and applications (Q3335644) (← links)
• (Q4578072) (← links)
• Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (Q4962207) (← links)
• Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
• Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)