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