Abstract
AbstractThe 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
