A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem |
scientific article; zbMATH DE number 5826013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem |
scientific article; zbMATH DE number 5826013 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9216527
0 references
0.9209319
0 references
0.9187243
0 references
0.9125751
0 references
0.91057265
0 references
0.9027474
0 references
