Cutting ellipses from area-minimizing rectangles (Q2250089): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LINDO / rank | |||
Normal rank | |||
Revision as of 23:03, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting ellipses from area-minimizing rectangles |
scientific article |
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
