科研之友
微信
新浪微博
Facebook
分享链接
摘要
The Compartmentalized Knapsack Problem has been reported in the literature to generate cutting patterns of problems in two stages. The problem has constrained case, which are considered limits on the number of compartments and items in the knapsack. An exact algorithm that involves the resolution of various knapsacks and heuristics based on upper bound has already been developed. In this paper we present the problem with mathematical models and propose new strategies for resolving the constrained case.
- 出版日期2010-6
