An efficient algorithm for the knapsack sharing problem
From MaRDI portal
Publication:1812082
DOI10.1023/A:1019920507008zbMath1064.90040MaRDI QIDQ1812082
Abdelkader Sbihi, Mhand Hifi, Slim Sadfi
Publication date: 18 June 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
An exact algorithm for large knapsack sharing problems, A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, New upper bounds and exact methods for the knapsack sharing problem, An exact algorithm for the knapsack sharing problem, Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item