Heuristics for solving the 2D rectangle packing area minimization problem based on a dynamic reduction method (Q5166004)
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: Heuristics for solving the 2D rectangle packing area minimization problem based on a dynamic reduction method |
scientific article; zbMATH DE number 6310663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for solving the 2D rectangle packing area minimization problem based on a dynamic reduction method |
scientific article; zbMATH DE number 6310663 |
Statements
Heuristics for Solving the 2D Rectangle Packing Area Minimization Problem Basing on a Dynamic Reduction Method (English)
0 references
30 June 2014
0 references
NP hard
0 references
layout optimization
0 references
floorplanning
0 references
area minimization
0 references
0.8945586681365967
0 references
0.8848403692245483
0 references
0.8027359843254089
0 references
0.8019295930862427
0 references
0.7937449216842651
0 references
