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)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
An exact algorithm for large knapsack sharing problems ⋮ A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs ⋮ New upper bounds and exact methods for the knapsack sharing problem ⋮ Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item ⋮ An exact algorithm for the knapsack sharing problem ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
This page was built for publication: An efficient algorithm for the knapsack sharing problem
