Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644)
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: Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem |
scientific article; zbMATH DE number 6066923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem |
scientific article; zbMATH DE number 6066923 |
Statements
Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (English)
0 references
16 August 2012
0 references
cutting problems
0 references
parallel algorithms
0 references
pattern dominances and symmetries
0 references
exact tree searches
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8098185062408447
0 references
0.803295910358429
0 references
0.7834692001342773
0 references
0.7735505104064941
0 references
