{"quality_controlled":"1","intvolume":"        55","author":[{"first_name":"Caroline","full_name":"Uhler, Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216"},{"full_name":"Wright, Stephen","last_name":"Wright","first_name":"Stephen"}],"external_id":{"arxiv":["1204.0235"]},"_id":"2280","issue":"4","date_created":"2018-12-11T11:56:44Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","title":"Packing ellipsoids with overlap","doi":"10.1137/120872309","page":"671 - 706","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.0235"}],"department":[{"_id":"CaUh"}],"year":"2013","volume":55,"date_published":"2013-11-07T00:00:00Z","oa_version":"Preprint","citation":{"ama":"Uhler C, Wright S. Packing ellipsoids with overlap. <i>SIAM Review</i>. 2013;55(4):671-706. doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” <i>SIAM Review</i>, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>.","apa":"Uhler, C., &#38; Wright, S. (2013). Packing ellipsoids with overlap. <i>SIAM Review</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>."},"publist_id":"4655","abstract":[{"text":"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.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","scopus_import":1,"date_updated":"2021-01-12T06:56:30Z","publication":"SIAM Review","publisher":"Society for Industrial and Applied Mathematics ","status":"public","day":"07"}