.png){kind=icon}
Return
An exact algorithm for the knapsack sharing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2003.11.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we develop an exact algorithm for solving the knapsack sharing problem. The algorithm is a new version of the method proposed in Hifi and Sadfi (J. Combin. Optim. 6 (2002) 35). It seems quite efficient in the sense that it solves quickly some large problem instances. Its main principle consists of (i) finding a good set of capacities, representing a set of critical elements, using a heuristic approach, and (ii) varying the values of the obtained set in order to stabilize the optimal solution of the problem. Then, by exploiting dynamic programming properties, we obtain good equilibrium which lead to significant improvements. The performance of the proposed algorithm, based on a set of medium and large problem instances, is compared to the standard version of Hifi and Sadfi (2002). Encouraging results have been obtained. (C) 2003 Elsevier Ltd. All rights reserved.
Keywords:
combinatorial optimization
knapsack sharing
dynamic programming
heuristics
optimization
stabilization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
ShareSave
View more