.png){kind=icon}
Return
Some exact algorithms for the knapsack sharing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00165-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is NP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carried out to analyse the behavior of the developed algorithms. As a result, we find that the binary search algorithm solves KSPs with up to 20000 variables in less than a minute in our computing environment. (C) 1998 Elsevier Science B.V.
Keywords:
knapsack sharing problem
combinatorial optimization
binary search method
max-min objective function
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more