A heuristic approach for packing identical rectangles in convex regions (Q632680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic approach for packing identical rectangles in convex regions |
scientific article; zbMATH DE number 5870587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic approach for packing identical rectangles in convex regions |
scientific article; zbMATH DE number 5870587 |
Statements
A heuristic approach for packing identical rectangles in convex regions (English)
0 references
25 March 2011
0 references
packing problems
0 references
mixed integer global optimization
0 references
iterated local search
0 references
monotonic basin hopping
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8001461625099182
0 references
0.7898355722427368
0 references
0.7830227613449097
0 references
0.7818493843078613
0 references
