期刊
SIAM REVIEW
卷 55, 期 4, 页码 671-706出版社
SIAM PUBLICATIONS
DOI: 10.1137/120872309
关键词
ellipsoid packing; trust-region algorithm; semidefinite programming; chromosome territories
资金
- NSF [DMS-0914524, DMS-0906818, DMS-1216318]
- DOE [DE-SC0002283]
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [1216318, 0914524] Funding Source: National Science Foundation
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据