Cutting ellipses from area-minimizing rectangles (Q2250089)
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 6313386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting ellipses from area-minimizing rectangles |
scientific article; zbMATH DE number 6313386 |
Statements
Cutting ellipses from area-minimizing rectangles (English)
0 references
4 July 2014
0 references
global optimization
0 references
non-convex nonlinear programming
0 references
mixed integer programming
0 references
cutting stock problem
0 references
packing problem
0 references
shape constraints
0 references
non-overlap constraints
0 references
design problem
0 references
polylithic solution approach
0 references
computational geometry
0 references
0 references
0 references
0 references
0.8678699731826782
0 references
0.80781489610672
0 references
0.798637330532074
0 references
0.7932270169258118
0 references
0.7873786687850952
0 references
