.png){kind=icon}
.png){kind=icon}
Return
The one dimensional compartmentalised knapsack problem: A case study
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.07.030.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Compartmentalised Knapsack Problem (CKP) is similar to the ordinary Knapsack Problem except that items to be packed belong to separate classes, and items can only be packed, in knapsack compartments, amongst items in their own class. This paper addresses a case study in the cutting of steel rolls in which the CKP arises. The rolls are cut in two-phases: the first phase produces sub-rolls (compartments) which are, after reducing the thickness, cut in a second phase to produce ribbons (a class consists of ordered items with the same thickness). Finally, two methods of solving CKP are presented, and these are used to generate columns in the classical linear optimisation model of Gilmore and Gomory. Results of computational experiments are presented. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
cutting and packing problem
Knapsack problems
combinatorial optimisation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available