A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780)
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, dynamic programming-based approach for a two-dimensional cutting problem with defects |
scientific article; zbMATH DE number 6379518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects |
scientific article; zbMATH DE number 6379518 |
Statements
A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (English)
0 references
11 December 2014
0 references
two-dimensional cutting
0 references
defects
0 references
computational complexity
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8574138879776001
0 references
0.8150026202201843
0 references
0.8082692623138428
0 references
0.8073135018348694
0 references
