A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:40, 30 January 2024
scientific article
| 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 |
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
