{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T11:51:01Z","timestamp":1768305061758,"version":"3.49.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["GR00022273"],"award-info":[{"award-number":["GR00022273"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10898-025-01464-x","type":"journal-article","created":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:57:47Z","timestamp":1736902667000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simultaneous convexification for the planar obnoxious facility location problem"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3546","authenticated-orcid":false,"given":"Anatoliy","family":"Kuznetsov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,15]]},"reference":[{"key":"1464_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Floudas, C.A.: Rigorous convex underestimators for general twice-differentiable problems. J. Glob. Optim. 9, 23\u201340 (1996)","journal-title":"J. Glob. Optim."},{"key":"1464_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1464_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EMB Smith","year":"1999","unstructured":"Smith, E.M.B., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"1464_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"1464_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011233805045","volume":"20","author":"M Tawarmalani","year":"2001","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel techniques for constructing convex envelopes of nonlinear functions. J. Glob. Optim. 20, 137\u2013158 (2001)","journal-title":"J. Glob. Optim."},{"key":"1464_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of lower semi-continuous functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"1464_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103, 207\u2013224 (2005)","journal-title":"Math. Program."},{"key":"1464_CR8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"1464_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10898-011-9747-5","volume":"52","author":"A Khajavirad","year":"2012","unstructured":"Khajavirad, A., Sahinidis, N.V.: Convex envelopes of products of convex and component-wise concave functions. J. Glob. Optim. 52, 391\u2013409 (2012)","journal-title":"J. Glob. Optim."},{"key":"1464_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.C.: Convex envelopes of monomials of odd degree. J. Glob. Optim. 25, 157\u2013168 (2003)","journal-title":"J. Glob. Optim."},{"key":"1464_CR11","unstructured":"De\u00a0Rosa, A., Khajavirad, A.: Explicit convex hull description of bivariate quadratic sets with indicator variables. arXiv (2022). https:\/\/arxiv.org\/abs\/2208.08703"},{"key":"1464_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10898-024-01397-x","volume":"90","author":"A Del Pia","year":"2024","unstructured":"Del Pia, A., Linderoth, J., Zhu, H.: Relaxations and cutting planes for linear programs with complementarity constraints. J. Glob. Optim. 90, 27\u201351 (2024)","journal-title":"J. Glob. Optim."},{"key":"1464_CR13","first-page":"619","volume":"587","author":"X Gu","year":"2023","unstructured":"Gu, X., Dey, S.S., Richard, J.-P.P.: Lifting convex inequalities for bipartite bilinear programs. Math. Program. 587, 619\u2013197 (2023)","journal-title":"Math. Program."},{"key":"1464_CR14","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10107-017-1197-5","volume":"172","author":"CH Lim","year":"2018","unstructured":"Lim, C.H., Linderoth, J., Luedtke, J.: Valid inequalities for separable concave constraints with indicator variables. Math. Program. 172, 415\u2013442 (2018)","journal-title":"Math. Program."},{"key":"1464_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10898-020-00975-z","volume":"80","author":"M Fampa","year":"2021","unstructured":"Fampa, M., Lee, J.: Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80, 287\u2013305 (2021)","journal-title":"J. Glob. Optim."},{"key":"1464_CR16","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1287\/moor.2021.1219","volume":"47","author":"J Kim","year":"2022","unstructured":"Kim, J., Tawarmalani, M., Richard, J.-P.P.: Convexification of permutation-invariant sets and an application to sparse principal component analysis. Math. Oper. Res. 47, 2547\u20132584 (2022)","journal-title":"Math. Oper. Res."},{"key":"1464_CR17","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-018-1306-0","volume":"178","author":"J Kim","year":"2019","unstructured":"Kim, J., Tawarmalani, M., Richard, J.-P.P.: On cutting planes for cardinality-constrained linear programs. Math. Program. 178, 417\u2013448 (2019)","journal-title":"Math. Program."},{"key":"1464_CR18","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1137\/16M1066166","volume":"27","author":"D Davarnia","year":"2017","unstructured":"Davarnia, D., Richard, J.-P.P., Tawarmalani, M.: Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. SIAM J. Optim. 27, 1801\u20131833 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1464_CR19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-023-01924-w","volume":"202","author":"S Han","year":"2023","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A.: 2$$\\times $$2-convexifications for convex quadratic optimization with indicator variables. Math. Program. 202(1), 95\u2013134 (2023)","journal-title":"Math. Program."},{"key":"1464_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10898-018-0626-1","volume":"72","author":"M Locatelli","year":"2018","unstructured":"Locatelli, M.: Convex envelopes of bivariate functions through the solution of KKT systems. J. Glob. Optim. 72, 277\u2013303 (2018)","journal-title":"J. Glob. Optim."},{"key":"1464_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-019-00846-2","volume":"76","author":"M Locatelli","year":"2020","unstructured":"Locatelli, M.: Convex envelope of bivariate cubic functions over rectangular regions. J. Glob. Optim. 76, 1\u201324 (2020)","journal-title":"J. Glob. Optim."},{"key":"1464_CR22","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1137\/19M1271762","volume":"31","author":"CJ Nohra","year":"2021","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.V.: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs. SIAM J. Optim. 31, 142\u2013171 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1464_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10107-021-01680-9","volume":"196","author":"CJ Nohra","year":"2022","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.V.: SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs. Math. Program. 196(1), 203\u201333 (2022)","journal-title":"Math. Program."},{"key":"1464_CR24","unstructured":"Tawarmalani, M.: Inclusion certificates and simultaneous convexification of functions. Working paper (2010). https:\/\/optimization-online.org\/2010\/09\/2722\/."},{"key":"1464_CR25","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1464_CR26","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"KM Anstreicher","year":"2010","unstructured":"Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124, 33\u201343 (2010)","journal-title":"Math. Program."},{"key":"1464_CR27","unstructured":"Ballerstein, M.: Convex relaxations for mixed-integer nonlinear programs. PhD thesis, ETH Zurich (2013)"},{"key":"1464_CR28","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10898-020-00974-0","volume":"80","author":"F Liers","year":"2021","unstructured":"Liers, F., Martin, A., Merkert, M., Mertens, N., Michaels, D.: Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80, 307\u2013340 (2021)","journal-title":"J. Glob. Optim."},{"key":"1464_CR29","doi-asserted-by":"crossref","unstructured":"Khajavirad, A.: The circle packing problem: A theoretical comparison of various convexification techniques (2024)","DOI":"10.1016\/j.orl.2024.107197"},{"key":"1464_CR30","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01442883","volume":"6","author":"RJ Hillestad","year":"1980","unstructured":"Hillestad, R.J., Jacobsen, S.E.: Reverse convex programming. Appl. Math. Optim. 6, 63\u201378 (1980)","journal-title":"Appl. Math. Optim."},{"key":"1464_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1464_CR32","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1109\/TWC.2020.3036701","volume":"20","author":"Y Inoue","year":"2021","unstructured":"Inoue, Y., Kodama, T., Kimura, T.: Global optimization of relay placement for seafloor optical wireless networks. IEEE Trans. Wireless Commun. 20(3), 1801\u20131815 (2021)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"3","key":"1464_CR33","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1137\/18M1190975","volume":"29","author":"Z Qi","year":"2019","unstructured":"Qi, Z., Cui, Y., Liu, Y., Pang, J.: Estimation of individualized decision rules based on an optimized covariate-dependent equivalent of random outcomes. SIAM J. Optim. 29(3), 2337\u20132362 (2019)","journal-title":"SIAM J. Optim."},{"key":"1464_CR34","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10898-020-00976-y","volume":"80","author":"A Wang","year":"2021","unstructured":"Wang, A., Gounaris, C.E.: On tackling reverse convex constraints for non-overlapping of unequal circles. J. Glob.Optim. 80, 357\u2013385 (2021)","journal-title":"J. Glob.Optim."},{"key":"1464_CR35","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Intersection cuts for polynomial optimization. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 72\u201387 (2019)","DOI":"10.1007\/978-3-030-17953-3_6"},{"key":"1464_CR36","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.omega.2018.08.013","volume":"87","author":"Z Drezner","year":"2019","unstructured":"Drezner, Z., Kalczynski, P., Salhi, S.: The planar multiple obnoxious facilities location problem: a Voronoi based heuristic. Omega 87, 105\u2013116 (2019)","journal-title":"Omega"},{"key":"1464_CR37","doi-asserted-by":"crossref","first-page":"105468","DOI":"10.1016\/j.cor.2021.105468","volume":"138","author":"RL Church","year":"2022","unstructured":"Church, R.L., Drezner, Z.: Review of obnoxious facilities location problems. Comput. Op. Res. 138, 105468 (2022)","journal-title":"Comput. Op. Res."},{"issue":"2","key":"1464_CR38","first-page":"68","volume":"29","author":"E Erkut","year":"1991","unstructured":"Erkut, E., Neuman, S.: Comparison of four models for dispersing facilities. INFOR: Inf. Syst. Op. Res. 29(2), 68\u201386 (1991)","journal-title":"INFOR: Inf. Syst. Op. Res."},{"issue":"3","key":"1464_CR39","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1111\/j.1538-4632.2006.00685.x","volume":"38","author":"KM Curtin","year":"2006","unstructured":"Curtin, K.M., Church, R.L.: A family of location models for multiple-type discrete dispersion. Geogr. Anal. 38(3), 248\u2013270 (2006)","journal-title":"Geogr. Anal."},{"issue":"1","key":"1464_CR40","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1111\/j.1435-5597.1998.tb00706.x","volume":"77","author":"AT Murray","year":"1998","unstructured":"Murray, A.T., Church, R.L., Gerrard, R.A., Tsui, W.: Impact models for siting undesirable facilities. Pap. Reg. Sci. 77(1), 19\u201336 (1998)","journal-title":"Pap. Reg. Sci."},{"key":"1464_CR41","first-page":"397","volume":"17","author":"SB Welch","year":"2008","unstructured":"Welch, S.B., Salhi, S., Drezner, Z.: The multifacility maximin planar location problem with facility interaction. IMA J. Manag. Math. 17, 397\u2013412 (2008)","journal-title":"IMA J. Manag. Math."},{"key":"1464_CR42","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tre.2017.09.005","volume":"107","author":"AWA Hammad","year":"2017","unstructured":"Hammad, A.W.A., Akbarnezhad, A., Rey, D.: Sustainable urban facility location: minimising noise pollution and network congestion. Transp. Res. Part E: Logistics Transp. Rev. 107, 38\u201359 (2017)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"1464_CR43","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/trsc.12.2.107","volume":"12","author":"RL Church","year":"1978","unstructured":"Church, R.L., Garfinkel, R.S.: Locating an obnoxious facility on a network. Transp. Sci. 12, 93\u2013178 (1978)","journal-title":"Transp. Sci."},{"issue":"1","key":"1464_CR44","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1111\/itor.12646","volume":"27","author":"N Mladenovi\u0107","year":"2020","unstructured":"Mladenovi\u0107, N., Alkandari, A., Pei, J., Todosijevi\u0107, R., Pardalos, P.M.: Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1), 480\u2013493 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"1464_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.10.020","volume":"425","author":"G Lin","year":"2018","unstructured":"Lin, G., Guan, J.: A hybrid binary particle swarm optimization for the obnoxious p-median problem. Inf. Sci. 425, 1\u201317 (2018)","journal-title":"Inf. Sci."},{"key":"1464_CR46","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10288-006-0023-3","volume":"5","author":"P Belotti","year":"2007","unstructured":"Belotti, P., Labb\u00e9, M., Maffioli, F., Ndiaye, M.M.: A branch-and-cut method for the obnoxious p-median problem. 4OR 5, 299\u2013314 (2007)","journal-title":"4OR"},{"key":"1464_CR47","first-page":"109","volume":"36","author":"F Plastria","year":"1996","unstructured":"Plastria, F.: Optimal location of undesirable facilities: a selective overview. Belg. J. Op. Res. , Stat. Comput. Sci. 36, 109\u2013127 (1996)","journal-title":"Belg. J. Op. Res. , Stat. Comput. Sci."},{"key":"1464_CR48","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1007\/s11590-021-01731-2","volume":"16","author":"P Kalczynski","year":"2022","unstructured":"Kalczynski, P., Drezner, Z.: Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. Optim. Lett. 16, 1153\u20131166 (2022)","journal-title":"Optim. Lett."},{"key":"1464_CR49","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1111\/itor.12736","volume":"27","author":"Z Drezner","year":"2020","unstructured":"Drezner, Z., Kalczynski, P.: Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming. Int. Trans. Oper. Res. 27, 1320\u20131342 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"1464_CR50","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cie.2019.05.014","volume":"133","author":"A Teran-Somohano","year":"2019","unstructured":"Teran-Somohano, A., Smith, A.E.: Locating multiple capacitated semi-obnoxious facilities using evolutionary strategies. Comput. Ind. Eng. 133, 303\u2013316 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"1464_CR51","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01097061","volume":"7","author":"H Tuy","year":"1995","unstructured":"Tuy, H., Al-Khayyal, F., Zhou, F.: A D.C. optimization method for single facility location problems. J. Glob. Optim. 7, 209\u2013227 (1995)","journal-title":"J. Glob. Optim."},{"key":"1464_CR52","first-page":"1","volume":"12","author":"E Carrizosa","year":"1999","unstructured":"Carrizosa, E., Plastria, F.: Location of semi-obnoxious facilities. Stud. Locat. Anal. 12, 1\u201327 (1999)","journal-title":"Stud. Locat. Anal."},{"key":"1464_CR53","doi-asserted-by":"crossref","unstructured":"Melachrinoudis, E.: The Location of Undesirable Facilities. Foundations of Location Analysis, pp. 207\u2013239. Springer, New York, NY (2011)","DOI":"10.1007\/978-1-4419-7572-0_10"},{"key":"1464_CR54","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1287\/opre.28.6.1385","volume":"28","author":"B Dasarathy","year":"1980","unstructured":"Dasarathy, B., White, L.J.: A maxmin location problem. Oper. Res. 28, 1385\u20131401 (1980)","journal-title":"Oper. Res."},{"issue":"4","key":"1464_CR55","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1111\/j.1467-9787.1992.tb00200.x","volume":"32","author":"P Chen","year":"1992","unstructured":"Chen, P., Hansen, P., Jaumard, B., Tuy, H.: Weber\u2019s problem with attraction and repulsion. J. Reg. Sci. 32(4), 467\u2013486 (1992)","journal-title":"J. Reg. Sci."},{"key":"1464_CR56","doi-asserted-by":"crossref","unstructured":"Maranas, C.D., Floudas, C.A.: In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds.) A Global Optimization Method For Weber\u2019s Problem With Attraction And Repulsion, pp. 259\u2013285. Springer, Boston, MA (1994)","DOI":"10.1007\/978-1-4613-3632-7_14"},{"key":"1464_CR57","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0377-2217(86)90045-7","volume":"24","author":"E Melachrinoudis","year":"1986","unstructured":"Melachrinoudis, E., Cullinane, T.P.: Locating an undesirable facility with a minimax criterion. Eur. J. Oper. Res. 24, 239\u2013246 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1464_CR58","first-page":"249","volume":"12","author":"Z Drezner","year":"1980","unstructured":"Drezner, Z., Wesolowsky, G.O.: A maximin location problem with maximum distance constraints. A I I E Trans. 12(3), 249\u2013252 (1980)","journal-title":"A I I E Trans."},{"key":"1464_CR59","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10, 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"1464_CR60","unstructured":"Gurobi Optimization: GUROBI Optimizer 10.0.2. http:\/\/www.gurobi.com\/ (2022)"},{"key":"1464_CR61","doi-asserted-by":"crossref","unstructured":"Bestuzheva, K., Chmiela, A., M\u00fcller, B., Serrano, F., Vigerske, S., Wegscheider, F.: Global optimization of mixed-integer nonlinear programs with SCIP 8. Journal of Global Optimization (2023)","DOI":"10.1007\/s10898-023-01345-1"},{"issue":"1","key":"1464_CR62","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M Locatelli","year":"2002","unstructured":"Locatelli, M., Raber, U.: Packing equal circles in a square: a deterministic global optimization approach. Discret. Appl. Math. 122(1), 139\u2013166 (2002)","journal-title":"Discret. Appl. Math."},{"key":"1464_CR63","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107\u2013139 (1996)","journal-title":"J. Glob. Optim."},{"key":"1464_CR64","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Grundlehren Text Editions, New York (2001)"},{"key":"1464_CR65","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10898-016-0450-4","volume":"67","author":"AM Gleixner","year":"2017","unstructured":"Gleixner, A.M., Berthold, T., M\u00fcller, B., Weltge, S.: Three enhancements for optimization-based bound tightening. J. Global Optim. 67, 731\u2013757 (2017)","journal-title":"J. Global Optim."},{"key":"1464_CR66","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg","year":"2008","unstructured":"Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, New York (2008)"},{"key":"1464_CR67","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"issue":"3","key":"1464_CR68","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"JE Falk","year":"1976","unstructured":"Falk, J.E., Hoffman, K.R.: A successive underestimation method for concave minimization problems. Math. Oper. Res. 1(3), 251\u2013259 (1976)","journal-title":"Math. Oper. Res."},{"key":"1464_CR69","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-012-0581-4","volume":"138","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Richard, J.-P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138, 531\u2013577 (2013)","journal-title":"Math. Program."},{"key":"1464_CR70","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10898-020-00886-z","volume":"77","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Sahinidis, N.V., Nohra, C., Rong, G.: Optimality-based domain reduction for inequality-constrained NLP and MINLP problems. J. Glob. Optim. 77, 425\u2013454 (2020)","journal-title":"J. Glob. Optim."},{"key":"1464_CR71","unstructured":"ILOG CPLEX Optimization Studio: CPLEX 22.1 Callable Library (C API) Reference Manual. IBM Corporation, Armonk, NY (2022). IBM Corporation"},{"key":"1464_CR72","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)","DOI":"10.1137\/1.9780898719604"},{"key":"1464_CR73","unstructured":"Kuznetsov, A., Sahinidis, N.V.: Nonconvex optimization problems involving the Euclidean norm: Challenges, progress, and opportunities. SIAM Review (2024). Under review"},{"key":"1464_CR74","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-020-01541-x","volume":"190","author":"T He","year":"2021","unstructured":"He, T., Tawarmalani, M.: A new framework to relax composite functions in nonlinear programs. Math. Program. 190, 427\u2013466 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1464_CR75","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1287\/moor.2021.1162","volume":"47","author":"T He","year":"2021","unstructured":"He, T., Tawarmalani, M.: Tractable relaxations of composite functions. Math. Oper. Res. 47(2), 1110\u20131140 (2021)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01464-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01464-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01464-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T03:23:30Z","timestamp":1746847410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01464-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1464"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01464-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,15]]},"assertion":[{"value":"4 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}