Pages that link to "Item:Q1039776"
From MaRDI portal
The following pages link to A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776):
Displayed 5 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← 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)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)