Cutting ellipses from area-minimizing rectangles

Title
Cutting ellipses from area-minimizing rectangles
Authors
Keywords
Global optimization, Non-convex nonlinear programming , Mixed integer programming, Cutting stock problem, Packing problem, Shape constraints, Non-overlap constraints , Design problem, Polylithic solution approach, Computational geometry
Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 59, Issue 2-3, Pages 405-437
Publisher
Springer Nature
Online
2013-12-06
DOI
10.1007/s10898-013-0125-3

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now