{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:36Z","timestamp":1740123276154,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["80NSSC19K0209"],"award-info":[{"award-number":["80NSSC19K0209"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10479-021-04281-z","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T08:13:35Z","timestamp":1632730415000},"page":"75-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Repulsion-based p-dispersion with distance constraints in non-convex polygons"],"prefix":"10.1007","volume":"307","author":[{"given":"Zhengguan","family":"Dai","sequence":"first","affiliation":[]},{"given":"Kathleen","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8510-8787","authenticated-orcid":false,"given":"Melkior","family":"Ornik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"4281_CR1","doi-asserted-by":"crossref","unstructured":"Akagi, T., Araki, T., Horiyama, T., Nakano, S., Okamoto, Y., Otachi, Y., & Wasa, K. (2018). Exact algorithms for the max-min dispersion problem. In 12th International workshop on frontiers in algorithmics (pp. 263\u2013272).","DOI":"10.1007\/978-3-319-78455-7_20"},{"key":"4281_CR2","unstructured":"Argo, T., & Sandstrom, E. (2014). Separation distances in NFPA codes and standards (Tech. Rep.). Fire Protection Research Foundation."},{"issue":"3","key":"4281_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1002\/nav.3800230305","volume":"23","author":"V Balachandran","year":"1976","unstructured":"Balachandran, V., & Jain, S. (1976). Optimal facility location under random demand with general cost structure. Naval Research Logistics Quarterly, 23(3), 421\u2013436.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"4281_CR4","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00453-001-0022-x","volume":"30","author":"C Baur","year":"2001","unstructured":"Baur, C., & Fekete, S. P. (2001). Approximation of geometric dispersion problems. Algorithmica, 30(3), 451.","journal-title":"Algorithmica"},{"issue":"3","key":"4281_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1111\/itor.12006","volume":"20","author":"EG Birgin","year":"2013","unstructured":"Birgin, E. G., Bustamante, L. H., Callisaya, H. F., & Mart\u00ednez, J. M. (2013). Packing circles within ellipses. International Transactions in Operational Research, 20(3), 365\u2013389.","journal-title":"International Transactions in Operational Research"},{"key":"4281_CR6","unstructured":"Bismarck Mandan Chamber EDC. (2009). Northern Plains Commerce Center . https:\/\/www.bismarckmandan.com\/northern-plains-commerce-center\/."},{"key":"4281_CR7","unstructured":"Calvert Soccer Association. (2017). Floorplan of the CSA Fieldhouse . https:\/\/www.leagueathletics.com\/Page.asp?n=131295&org=calvertsoccer.org."},{"issue":"3","key":"4281_CR8","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ejor.2007.01.054","volume":"191","author":"I Castillo","year":"2008","unstructured":"Castillo, I., Kampas, F. J., & Pint\u00e9r, J. D. (2008). Solving circle packing problems by global optimization: Numerical results and industrial applications. European Journal of Operational Research, 191(3), 786\u2013802.","journal-title":"European Journal of Operational Research"},{"key":"4281_CR9","doi-asserted-by":"crossref","unstructured":"Ciarlet, P. G. (2013). Linear and nonlinear functional analysis with applications. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611972597"},{"key":"4281_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-2039-z","volume":"136","author":"A Dimnaku","year":"2005","unstructured":"Dimnaku, A., Kincaid, R. K., & Trosset, M. W. (2005). Approximate solutions of continuous dispersion problems. Annals of Operations Research, 136, 65\u201380.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"4281_CR11","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1057\/jors.1995.70","volume":"46","author":"Z Drezner","year":"1995","unstructured":"Drezner, Z., & Erkut, E. (1995). Solving the continuous p-dispersion problem using non-linear programming. Journal of the Operational Research Society, 46(4), 516\u2013520.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4281_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E. (1990). The discrete p-dispersion problem. European Journal of Operational Research, 46(1), 48\u201360.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4281_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut, E., & Neuman, S. (1989). Analytical models for locating undesirable facilities. European Journal of Operational Research, 40(3), 275\u2013291.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"4281_CR14","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/0305-0548(94)90041-8","volume":"21","author":"E Erkut","year":"1994","unstructured":"Erkut, E., \u00dclk\u00fcsal, Y., & Yeni\u00e7erio\u01e7lu, O. (1994). A comparison of p-dispersion heuristics. Computers & Operations Research, 21(10), 1103\u20131113.","journal-title":"Computers & Operations Research"},{"key":"4281_CR15","unstructured":"Friedman, E. (2019). Erich\u2019s packing center. https:\/\/www2.stetson.edu\/~efriedma\/packing.html."},{"issue":"4","key":"4281_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ejor.2013.04.050","volume":"230","author":"SI Galiev","year":"2013","unstructured":"Galiev, S. I., & Lisafina, M. S. (2013). Linear models for the approximate solution of the problem of packing equal circles into a given domain. European Journal of Operational Research, 230(4), 505.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4281_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(97)00050-2","volume":"181","author":"RL Graham","year":"1998","unstructured":"Graham, R. L., Lubachevsky, B. D., Nurmela, K. J., & \u00d6sterg\u00e5rd, P. R. (1998). Dense packings of congruent circles in a circle. Discrete Mathematics, 181(1), 139\u2013154.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"4281_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"S Hesse Owen","year":"1998","unstructured":"Hesse Owen, S., & Daskin, M. S. (1998). Strategic facility location: A review. European Journal of Operational Research, 111(3), 423\u2013447.","journal-title":"European Journal of Operational Research"},{"key":"4281_CR19","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/150624","author":"M Hifi","year":"2009","unstructured":"Hifi, M., & M\u2018Hallah, R. (2009). A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research. https:\/\/doi.org\/10.1155\/2009\/150624","journal-title":"Advances in Operations Research"},{"key":"4281_CR20","unstructured":"Ho, I.-T. (2015). Improvements on circle packing algorithms in two-dimensional cross-sectional areas (Tech. Rep.). University of Waterloo."},{"key":"4281_CR21","doi-asserted-by":"crossref","unstructured":"Joint Chiefs of Staff. (1996). Joint tactics, techniques, and procedures for base defense (Tech. Rep. No. Joint Pub 3-10.1). United States Department of Defense.","DOI":"10.21236\/ADA434132"},{"key":"4281_CR22","doi-asserted-by":"crossref","unstructured":"Kazakov, A. L., Lempert, A. A., & Nguyen, H. L. (2016). The problem of the optimal packing of the equal circles for special non-Euclidean metric. In 5th international conference on analysis of images, social networks and texts (pp. 58\u201368).","DOI":"10.1007\/978-3-319-52920-2_6"},{"issue":"4","key":"4281_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"MJ Kuby","year":"1987","unstructured":"Kuby, M. J. (1987). Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems. Geographical Analysis, 19(4), 315\u2013329.","journal-title":"Geographical Analysis"},{"key":"4281_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S. M. (2006). Planning algorithms. Cambridge University Press."},{"issue":"3","key":"4281_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ejor.2011.04.024","volume":"214","author":"CO L\u00f3pez","year":"2011","unstructured":"L\u00f3pez, C. O., & Beasley, J. E. (2011). A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research, 214(3), 512\u2013525.","journal-title":"European Journal of Operational Research"},{"key":"4281_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cagd.2017.03.006","volume":"52\u201353","author":"J Machchhar","year":"2017","unstructured":"Machchhar, J., & Elber, G. (2017). Dense packing of congruent circles in free-form non-convex containers. Computer Aided Geometric Design, 52\u201353, 13\u201327.","journal-title":"Computer Aided Geometric Design"},{"issue":"4","key":"4281_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.compenvurbsys.2011.12.006","volume":"36","author":"PJ Maliszewski","year":"2012","unstructured":"Maliszewski, P. J., Kuby, M. J., & Horner, M. W. (2012). A comparison of multi-objective spatial dispersion models for managing critical assets in urban areas. Computers, Environment and Urban Systems, 36(4), 331\u2013341.","journal-title":"Computers, Environment and Urban Systems"},{"key":"4281_CR28","doi-asserted-by":"crossref","unstructured":"Martinez-Rios, F., Marmolejo-Saucedo, J. A., & Murillo-Suarez, A. (2018). A new heuristic algorithm to solve circle packing problem inspired by nanoscale electromagnetic fields and gravitational effects. In 4th International conference on nanotechnology for instrumentation and measurement.","DOI":"10.1109\/NANOFIM.2018.8688621"},{"issue":"3","key":"4281_CR29","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"I Moon","year":"1984","unstructured":"Moon, I., & Chaudhry, S. S. (1984). An analysis of network location problems with distance constraints. Management Science, 30(3), 290\u2013307.","journal-title":"Management Science"},{"key":"4281_CR30","unstructured":"29 C.F.R. \u00a71910.157. (2021). Portable fire extinguishers. Title 29 Code of Federal Regulations, Part 157."},{"key":"4281_CR31","unstructured":"49 C.F.R. \u00a7175.701. (2021). Separation distance requirements for packages containing Class 7 (radioactive) materials in passenger-carrying aircraft. Title 49 Code of Federal Regulations, Part 175"},{"key":"4281_CR32","unstructured":"Strasser, Scott. (2020). Design completed for Langdon high school . https:\/\/www.airdrietoday.com\/rocky-view-news\/design-completed-for-langdon-high-school-2514811."},{"issue":"2","key":"4281_CR33","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"RM Soland","year":"1974","unstructured":"Soland, R. M. (1974). Optimal facility location with concave costs. Operations Research, 22(2), 373\u2013382.","journal-title":"Operations Research"},{"key":"4281_CR34","doi-asserted-by":"crossref","unstructured":"Yuan, Z., Zhang, Y., Dragoi, M. V., & Bai, X. T. (2018). Packing circle items in an arbitrary marble slab. In 3rd China-Romania science and technology seminar.","DOI":"10.1088\/1757-899X\/399\/1\/012059"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04281-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04281-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04281-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T12:11:59Z","timestamp":1699531919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04281-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4281"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04281-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"19 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors foresee no conflict of interest or competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"A software implementation of the proposed algorithm is available at.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}