@article{(Open Science Index):https://publications.waset.org/pdf/12585, title = {The Knapsack Sharing Problem: A Tree Search Exact Algorithm}, author = {Mhand Hifi and Hedi Mhalla}, country = {}, institution = {}, abstract = {In this paper, we study the knapsack sharing problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of a tree search for optimally solving the problem. The used method combines two complementary phases: a reduction interval search phase and a branch and bound procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for decomposing the problem into a series of knapsack problems. Second, the tree search procedure is applied in order to attain a set of optimal capacities characterizing the knapsack problems. Finally, the performance of the proposed optimal algorithm is evaluated on a set of instances of the literature and its runtime is compared to the best exact algorithm of the literature. }, journal = {International Journal of Computer and Information Engineering}, volume = {4}, number = {6}, year = {2010}, pages = {1115 - 1118}, ee = {https://publications.waset.org/pdf/12585}, url = {https://publications.waset.org/vol/42}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 42, 2010}, }