A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/eor/SongCLNT10, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/eor/SongCLNT10 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 13 November 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
