An and-or-graph approach for two-dimensional cutting problems (Q1194741)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 68477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An and-or-graph approach for two-dimensional cutting problems |
scientific article; zbMATH DE number 68477 |
Statements
An and-or-graph approach for two-dimensional cutting problems (English)
0 references
6 October 1992
0 references
cutting stock
0 references
and-or-graph search
0 references
guillotine cutting patterns
0 references
rectangular plate
0 references
depth-first
0 references
hill-climbing
0 references
heuristics
0 references
0.96992373
0 references
0.93197674
0 references
0.9223275
0 references
0.8960151
0 references
0.8956093
0 references
0.89344376
0 references
0.88898945
0 references
0.8854074
0 references
0.88414437
0 references
0.8809521
0 references
