A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem |
scientific article |
Statements
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (English)
0 references
13 December 2010
0 references
cutting and packing problems
0 references
constrained two-dimensional guillotine cutting patterns
0 references
dynamic programming
0 references
and/or-graph search
0 references
heuristics
0 references
