The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127613595, #quickstatements; #temporary_batch_1722796506534 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00060-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160776415 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127613595 / rank | |||
Normal rank | |||
Latest revision as of 19:36, 4 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems |
scientific article |
Statements
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (English)
0 references
22 February 1999
0 references
weighted and unweighted unconstrained two-dimensional guillotine cutting
0 references
depth-first search
0 references
hill-climbing
0 references
one-dimensional knapsack
0 references
dynamic programming
0 references
