Pages that link to "Item:Q1304387"
From MaRDI portal
The following pages link to A note on the max-min 0-1 knapsack problem (Q1304387):
Displayed 9 items.
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)