New upper bounds and exact methods for the knapsack sharing problem

作者：

Highlights：

• A new upper bound is proposed for the knapsack sharing problem.

• A new dichotomous search-based exact algorithm is proposed.

• The new algorithm outperforms a most recent exact algorithm of the literature and the Cplex solver V 12.

摘要

•A new upper bound is proposed for the knapsack sharing problem.•A new dichotomous search-based exact algorithm is proposed.•The new algorithm outperforms a most recent exact algorithm of the literature and the Cplex solver V 12.

论文关键词：Combinatorial optimization,Decomposition,Discrete optimization,Knapsack,Optimality,Sharing,Upper bound

论文评审过程：Available online 8 December 2013.

论文官网地址：https://doi.org/10.1016/j.amc.2013.11.040