An exact approach for the 0-1 knapsack problem with setups

详细信息    查看全文

• 作者：Federico Della Croce ; ^{federico.dellacroce@polito.it} ; Fabio Salassa ; Rosario Scatamacchia
• 关键词：Knapsack problem with setups ; Exact approach ; 0&ndash ; 1 Programming
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：61-67
• 全文大小：353 K
• 卷排序：80

文摘

An exact approach is proposed for the 0/1 knapsack problem with setups (KPS). The approach is based on an ILP formulation with two variables sets. A 2-level partitioning of these sets in the branching scheme is exploited. The approach solves to optimality all instances with up to 100,000 variables.