Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2189339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved local search algorithms for the rectangle packing problem with general spatial costs |
scientific article; zbMATH DE number 2189339 |
Statements
Improved local search algorithms for the rectangle packing problem with general spatial costs (English)
0 references
1 August 2005
0 references
Packing
0 references
Sequence pair
0 references
General spatial cost
0 references
Dynamic programming
0 references
Local search
0 references
0 references
0 references
0 references
0.9578132629394532
0 references
0.7942007184028625
0 references
0.7584003210067749
0 references
0.7532153725624084
0 references
