Cutting ellipses from area-minimizing rectangles

标题

作者

关键词

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 OF GLOBAL OPTIMIZATION

Volume 59, Issue 2-3, Pages 405-437

出版商

Springer Nature

发表日期

2013-12-06

DOI

10.1007/s10898-013-0125-3

参考文献

查看 3 条相关文献

向作者/读者发起求助以获取更多资源

Protocol

在线求助

Reagent

在线求助

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Create your own webinar

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

Create Now