Numerical optimization method for packing regular convex polygons (Q519665)
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: Numerical optimization method for packing regular convex polygons |
scientific article; zbMATH DE number 6701153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical optimization method for packing regular convex polygons |
scientific article; zbMATH DE number 6701153 |
Statements
Numerical optimization method for packing regular convex polygons (English)
0 references
5 April 2017
0 references
packing problem
0 references
polygon packing
0 references
packing of polygons in a given domain
0 references
packing of regular convex polygons
0 references
linear programming problem
0 references
numerical algorithm
0 references
algorithm
0 references
numerical result
0 references
0 references
0 references
0 references
0.8418640494346619
0 references
0.8145536184310913
0 references
