.png){kind=icon}
.png){kind=icon}
Return
An integer linear optimization model to the compartmentalized knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12490.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The compartmentalized knapsack problem arose from two-phased cutting stock problems, especially with steel roll cutting. In its original formulation, it refers to an integer nonlinear optimization model, which, up to now, has been solved through decomposition heuristics. The objective of this article is to show that the constrained compartmentalized knapsack problem has a linear optimization model. Therefore, we have considered the original nonlinear model and propose a linear model for the problem, demonstrating their equivalence. We also propose a new decomposition heuristic and perform numerical tests to verify the limits of the proposed model and the quality of the heuristic solutions.
Keywords:
compartmentalized knapsack problem
discrete optimization
linear optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K