A note on the max-min 0-1 knapsack problem
From MaRDI portal
Publication:1304387
DOI10.1023/A:1009821323279zbMath0935.90024MaRDI QIDQ1304387
Publication date: 17 February 2000
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items
Recoverable robust knapsacks: the discrete scenario case, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem, Complexity results and exact algorithms for robust knapsack problems, A note on upper bounds to the robust knapsack problem with discrete scenarios, A randomized algorithm for the min-Max selecting items problem with uncertain weights, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, Hybrid approaches for the two-scenario max-min knapsack problem, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem