The knapsack sharing problem: an exact algorithm
From MaRDI portal
Publication:702349
DOI10.1023/A:1013385216761zbMath1058.90055MaRDI QIDQ702349
Publication date: 17 January 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items (10)
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study ⋮ An exact algorithm for large knapsack sharing problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An exact decomposition algorithm for the generalized knapsack sharing problem ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ 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 ⋮ Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study ⋮ An exact algorithm for the knapsack sharing problem with common items
This page was built for publication: The knapsack sharing problem: an exact algorithm
