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