Pages that link to "Item:Q296586"
From MaRDI portal
The following pages link to Robust combinatorial optimization with variable cost uncertainty (Q296586):
Displaying 12 items.
- Adjustable robustness for multi-attribute project portfolio selection (Q323007) (← links)
- Robust balanced optimization (Q668952) (← links)
- Robust optimization for non-linear impact of data variation (Q1654345) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- Adjustable robust optimization through multi-parametric programming (Q2182773) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)