期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 65, 期 4, 页码 709-743出版社
SPRINGER
DOI: 10.1007/s10898-015-0395-z
关键词
Cutting and packing ellipsoids; Nonlinear programming; Models; Numerical experiments
资金
- PRONEX-CNPq/FAPERJ [E-26/111.449/2010-APQ1]
- FAPESP [2010/10133-0, 2013/03447-6, 2013/05475-7, 2013/07375-0, 2012/23916-8]
- CNPq
In this paper, continuous and differentiable nonlinear programming models and algorithms for packing ellipsoids in the n-dimensional space are introduced. Two different models for the non-overlapping and models for the inclusion of ellipsoids within half-spaces and ellipsoids are presented. By applying a simple multi-start strategy combined with a clever choice of starting guesses and a nonlinear programming local solver, illustrative numerical experiments are presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据