An exact algorithm for the Knapsack Problem with Setup
International Journal of Operational Research(2009)
摘要
In this paper we studies a 0-1 Knapsack Problem with Setup (KPS). One set of 0-1 variables represent a family setup and serve as an Upper Bound (UB) on another set of 0-1 variables representing production of a job in a family. We present a branch-and-bound algorithm to find an optimal solution to KPS. The algorithm uses a two-stage branching strategy and chooses the next candidate problem to explore in a non-traditional way. We verify the efficacy of the algorithm through computational testing. This is the first time that an exact algorithm given to KPS with 10,000 integer variables. Computational experiments show that this algorithm is especially effective when objective and constraint coefficients are uncorrelated.
更多查看译文
关键词
knapsack problem,upper bound,branch and bound
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要