A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57185717, #quickstatements; #temporary_batch_1706974296281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57185717 / rank | |||
Normal rank | |||
Revision as of 18:03, 3 February 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
