.png){kind=icon}
Return
BOUNDS FOR NESTED KNAPSACK-PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0211-F.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a specific nested knapsack problem is considered and expressed as an integer linear programme. Nested knapsack problems can occur as subproblems of an important type of the cutting stock problem where there are successive cutting stages. In these problems only splitting (and not regrouping) of knapsack items is allowed between each stage. A series of a priori bounds, which are also applicable to bin packing problems, are established to assist in solving this problem.
Keywords:
KNAPSACK
CUTTING STOCK
NESTING
PACKING
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
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave no more
no more