Pages that link to "Item:Q2247901"
From MaRDI portal
The following pages link to Complexity results and exact algorithms for robust knapsack problems (Q2247901):
Displaying 7 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Optimal Genetic Screening for Cystic Fibrosis (Q5031012) (← links)
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
