.png){kind=icon}
返回
A strong integer linear optimization model to the compartmentalized knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12639.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The compartmentalized knapsack problem (CKP) is a relatively new type of problem with a wide application in industrial processes, arising, for instance, in the case of cutting steel coils in two phases in the metallurgicalindustry. In the literature, there are two mathematical formulations for the CKP: a classical formulation, which is a nonlinear integer programming (IP) model, and a recent (linear) IP formulation, obtained by discretizing the compartments that can be built for each class of items; the latter is an important contribution, because it makes the problem amenable to solution by mixed-integer linear programming tools. Combinatorial enumeration algorithms and several pseudo-polynomial decomposition heuristics were also developed for theCKP. This paper presents a new model for the exact solution of the CKP, denoted as the strong integer linear model, derived from the (linear) IP formulation by strengthening data, reducing symmetry, and lifting, and also a new pseudo-polynomial heuristic, the heuristic of the pk strong capacities. Computational experiments are presented with a large set of instances that show the advantage of the new approaches. The strong model solves the CKP exactly more than seven times faster, and the new heuristic is more efficient, presenting a good balance in the terms ofeffectiveness.
Keyword:
compartmentalized knapsack problem
linear strong model optimization
discrete optimization
linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
分享收藏
分享收藏分享收藏Cassava mosaic virus in Africa: Functional analysis of virus coat proteins based on evolutionary processes and protein structure.png)
Gene Reports
Gene ReportsIF0
PREAI
分享收藏
查看更多内容