A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779)
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 worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting |
scientific article; zbMATH DE number 5637062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting |
scientific article; zbMATH DE number 5637062 |
Statements
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (English)
0 references
23 November 2009
0 references
heuristic
0 references
dynamic programming
0 references
2D cutting
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
