Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: COIN-OR / rank | |||
Normal rank | |||
Revision as of 12:40, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing |
scientific article |
Statements
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (English)
0 references
15 November 2012
0 references
guillotine cutting
0 references
three-dimensional cutting stock
0 references
unbounded knapsack
0 references
strip packing
0 references
column generation
0 references
