{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:44:56Z","timestamp":1769766296317,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11590-020-01596-x","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T18:05:18Z","timestamp":1589911518000},"page":"377-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Exact approaches for competitive facility location with discrete attractiveness"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0691-5266","authenticated-orcid":false,"given":"Yun Hui","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyun","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,19]]},"reference":[{"issue":"9","key":"1596_CR1","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha $$bb, for general twice-differentiable constrained NLPS\u2013I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1596_CR2","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.1110.1037","volume":"60","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Berenguer, G., Shen, Z.J.: A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60(2), 366\u2013381 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"1596_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-009-0282-9","volume":"126","author":"A Atamt\u00fcrk","year":"2011","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Math. Program. 126(2), 351\u2013363 (2011)","journal-title":"Math. Program."},{"key":"1596_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. SIAM, Philadelphia (2001)"},{"issue":"3","key":"1596_CR5","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","volume":"143","author":"S Benati","year":"2002","unstructured":"Benati, S., Hansen, P.: The maximum capture problem with random utilities: problem formulation and algorithms. Eur. J. Oper. Res. 143(3), 518\u2013530 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1596_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10898-016-0487-4","volume":"69","author":"JS Borrero","year":"2017","unstructured":"Borrero, J.S., Gillen, C., Prokopyev, O.A.: Fractional 0\u20131 programming: applications and algorithms. J. Glob. Optim. 69(1), 255\u2013282 (2017)","journal-title":"J. Glob. Optim."},{"key":"1596_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"1596_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"MT \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104(1), 179\u2013202 (2005)","journal-title":"Math. Program."},{"issue":"83","key":"1596_CR9","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a Python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1596_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cor.2015.04.012","volume":"64","author":"T Drezner","year":"2015","unstructured":"Drezner, T., Drezner, Z., Kalczynski, P.: A leader\u2013follower model for discrete competitive facility location. Comput. Oper. Res. 64, 51\u201359 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1596_CR11","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/S0377-2217(01)00168-0","volume":"142","author":"T Drezner","year":"2002","unstructured":"Drezner, T., Drezner, Z., Salhi, S.: Solving the multiple competitive facilities location problem. Eur. J. Oper. Res. 142(1), 138\u2013151 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1596_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.orl.2018.02.008","volume":"46","author":"T Drezner","year":"2018","unstructured":"Drezner, T., Drezner, Z., Zerom, D.: Competitive facility location with random attractiveness. Oper. Res. Lett. 46(3), 312\u2013317 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"1596_CR13","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S.: Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6), 615\u2013624 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1596_CR14","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1016\/j.ejor.2006.02.005","volume":"179","author":"J Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, J., Pelegr\u0131, B., Plastria, F., T\u00f3th, B.: Solving a huff-like competitive location and design model for profit maximization in the plane. Eur. J. Oper. Res. 179(3), 1274\u20131287 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1596_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","volume-title":"Recent Advances in Learning and Control","author":"M Grant","year":"2008","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V.D., Boyd, S.P., Kimura, H. (eds.) Recent Advances in Learning and Control, pp. 95\u2013110. Springer, Berlin (2008)"},{"key":"1596_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization, pp. 155\u2013210. Springer, Berlin (2006)"},{"issue":"3","key":"1596_CR17","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ejor.2013.08.009","volume":"232","author":"K Haase","year":"2014","unstructured":"Haase, K., M\u00fcller, S.: A comparison of linear reformulations for multinomial logit choice probabilities in facility location models. Eur. J. Oper. Res. 232(3), 689\u2013691 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"1596_CR18","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1057\/jors.2010.136","volume":"62","author":"H K\u00fc\u00e7\u00fckayd\u0131n","year":"2011","unstructured":"K\u00fc\u00e7\u00fckayd\u0131n, H., Aras, N., Alt\u0131nel, \u0130.: A discrete competitive facility location model with variable attractiveness. J. Oper. Res. Soc. 62(9), 1726\u20131741 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1596_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ejor.2010.08.009","volume":"208","author":"H K\u00fc\u00e7\u00fckaydin","year":"2011","unstructured":"K\u00fc\u00e7\u00fckaydin, H., Aras, N., Alt\u0131nel, I.K.: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution. Eur. J. Oper. Res. 208(3), 206\u2013220 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1596_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.cor.2011.05.007","volume":"39","author":"H K\u00fc\u00e7\u00fckayd\u0131n","year":"2012","unstructured":"K\u00fc\u00e7\u00fckayd\u0131n, H., Aras, N., Alt\u0131nel, \u0130.K.: A leader\u2013follower game in competitive facility location. Comput. Oper. Res. 39(2), 437\u2013448 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1596_CR21","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11590-015-0930-3","volume":"11","author":"A Lan\u010dinskas","year":"2017","unstructured":"Lan\u010dinskas, A., Fern\u00e1ndez, P., Peleg\u00edn, B., \u017dilinskas, J.: Improving solution of discrete competitive facility location problems. Optim. Lett. 11(2), 259\u2013270 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"1596_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2017.09.023","volume":"266","author":"I Ljubi\u0107","year":"2018","unstructured":"Ljubi\u0107, I., Moreno, E.: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266(1), 46\u201356 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1596_CR23","doi-asserted-by":"publisher","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\u2014convex underestimating problems. Math. program. 10(1), 147\u2013175 (1976)","journal-title":"Math. program."},{"key":"1596_CR24","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2012.03.003","volume":"164","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz, I., Bront, J.J., Vulcano, G., Zabala, P.: A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164, 246\u2013263 (2014)","journal-title":"Discrete Appl. Math."},{"key":"1596_CR25","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.cie.2017.04.024","volume":"112","author":"M Qi","year":"2017","unstructured":"Qi, M., Xia, M., Zhang, Y., Miao, L.: Competitive facility location problem with foresight considering service distance limitations. Comput. Ind. Eng. 112, 483\u2013491 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"1596_CR26","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00291-008-0133-8","volume":"31","author":"ME S\u00e1iz","year":"2009","unstructured":"S\u00e1iz, M.E., Hendrix, E.M., Fern\u00e1ndez, J., Pelegr\u00edn, B.: On a branch-and-bound approach for a huff-like stackelberg location problem. OR Spectrum 31(3), 679\u2013705 (2009)","journal-title":"OR Spectrum"},{"issue":"4","key":"1596_CR27","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1287\/opre.2017.1703","volume":"66","author":"A \u015een","year":"2018","unstructured":"\u015een, A., Atamt\u00fcrk, A., Kaminsky, P.: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4), 994\u20131003 (2018)","journal-title":"Oper. Res."},{"issue":"3","key":"1596_CR28","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1596_CR29","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12532-016-0113-y","volume":"9","author":"JP Vielma","year":"2017","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3), 369\u2013418 (2017)","journal-title":"Math. Program. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01596-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:15:35Z","timestamp":1621383335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01596-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,19]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1596"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01596-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,19]]},"assertion":[{"value":"5 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}