Pages that link to "Item:Q3195317"
From MaRDI portal
The following pages link to Lagrangean Decomposition for Mean-Variance Combinatorial Optimization (Q3195317):
Displaying 11 items.
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- Ranking robustness and its application to evacuation planning (Q1681390) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- A perfect information lower bound for robust lot-sizing problems (Q1730584) (← links)
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
