{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:33Z","timestamp":1777870593176,"version":"3.51.4"},"reference-count":62,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFA1000300"],"award-info":[{"award-number":["2021YFA1000300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["92473208"],"award-info":[{"award-number":["92473208"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFA1000301"],"award-info":[{"award-number":["2021YFA1000301"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571317"],"award-info":[{"award-number":["12571317"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013076","name":"National Major Science and Technology Projects of China","doi-asserted-by":"publisher","award":["2025ZD1607600"],"award-info":[{"award-number":["2025ZD1607600"]}],"id":[{"id":"10.13039\/501100013076","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2026.02.010","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T16:42:09Z","timestamp":1770914529000},"page":"349-364","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-1346","authenticated-orcid":false,"given":"Wei-Kun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8476-5276","authenticated-orcid":false,"given":"Wei-Yang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6256-2328","authenticated-orcid":false,"given":"Yan-Ru","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6606-9698","authenticated-orcid":false,"given":"Shahin","family":"Gelareh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6932-9512","authenticated-orcid":false,"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0001","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ejor.2006.07.021","article-title":"Competitive facility location and design problem","volume":"182","author":"Aboolian","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0002","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","article-title":"Maximizing a class of submodular utility functions","volume":"128","author":"Ahmed","year":"2011","journal-title":"Mathematical Programming"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.010_bib0003","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1007\/s11590-020-01684-y","article-title":"Linear and conic reformulations for the maximum capture location problem under multinomial logit choice","volume":"15","author":"Altekin","year":"2021","journal-title":"Optimization Letters"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0004","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.ejor.2012.11.006","article-title":"p-Hub approach for the optimal park-and-ride facility location problem","volume":"226","author":"Aros-Vera","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0005","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-009-0265-x","article-title":"On splittable and unsplittable flow capacitated network design arc-set polyhedra","volume":"92","author":"Atamt\u00fcrk","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.02.010_bib0006","first-page":"3","article-title":"Submodularity in competitive location problems","volume":"26","author":"Benati","year":"1997","journal-title":"Ricera Operativa"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0007","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","article-title":"The maximum capture problem with random utilities: problem formulation and algorithms","volume":"143","author":"Benati","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.010_bib0008","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1016\/j.cor.2013.02.023","article-title":"Branch-and-bound algorithm for a competitive facility location problem","volume":"40","author":"Beresnev","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0009","series-title":"Decision technologies and applications","first-page":"156","article-title":"Modeling competitive facility location problems: New approaches and results","author":"Berman","year":"2009"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2026.02.010_bib0010","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10472-014-9448-0","article-title":"Models and algorithms for competitive facility location problems with different customer behavior","volume":"76","author":"Biesinger","year":"2016","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0011","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/ijoc.2016.0717","article-title":"Strengthened Benders cuts for stochastic integer programs with continuous recourse","volume":"29","author":"Bodur","year":"2017","journal-title":"INFORMS Journal on Computing"},{"issue":"7","key":"10.1016\/j.ejor.2026.02.010_bib0012","doi-asserted-by":"crossref","first-page":"2073","DOI":"10.1287\/mnsc.2016.2455","article-title":"Mixed-integer rounding enhanced Benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty","volume":"63","author":"Bodur","year":"2017","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0013","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10898-022-01252-x","article-title":"Lifting for the integer knapsack cover polyhedron","volume":"86","author":"Chen","year":"2023","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0014","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","article-title":"Benders decomposition for very large scale partial set covering and maximal covering location problems","volume":"275","author":"Cordeau","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0015","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.ejor.2021.09.006","article-title":"Submodularity and local search approaches for maximum capture problems under generalized extreme value models","volume":"300","author":"Dam","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0016","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.orl.2018.02.008","article-title":"Competitive facility location with random attractiveness","volume":"46","author":"Drezner","year":"2018","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0017","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.ejor.2023.10.030","article-title":"Competitive location models: A review","volume":"316","author":"Drezner","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0018","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0377-2217(96)00216-0","article-title":"Sequential location problems","volume":"96","author":"Eiselt","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0019","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2016.10.002","article-title":"New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior","volume":"79","author":"Fern\u00e1ndez","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2020.113200","article-title":"Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule","volume":"385","author":"Fern\u00e1ndez","year":"2021","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0021","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.ejor.2016.03.002","article-title":"Benders decomposition without separability: A computational study for capacitated facility location problems","volume":"253","author":"Fischetti","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0022","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.ejor.2015.12.026","article-title":"A branch-and-bound algorithm for the maximum capture problem with random utilities","volume":"252","author":"Freire","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0023","series-title":"Advances in artificial intelligence","first-page":"142","article-title":"Iterated local search for the facility location problem with limited choice rule","volume":"vol. 14640","author":"Garc\u00eda-Gal\u00e1n","year":"2024"},{"key":"10.1016\/j.ejor.2026.02.010_bib0024","article-title":"An efficient variable neighborhood search approach for the facility location problem with the limited choice rule","volume":"online","author":"Garc\u00eda-Gal\u00e1n","year":"2025","journal-title":"International Transaction in Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.jmateco.2020.11.003","article-title":"Shortlisting procedure with a limited capacity","volume":"94","author":"Geng","year":"2021","journal-title":"Journal of Mathematical Economics"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0026","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.ejor.2017.08.041","article-title":"Integer programming formulations for three sequential discrete competitive location problems with foresight","volume":"265","author":"Gentile","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.010_bib0027","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"Generalized Benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0028","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","article-title":"Sequence independent lifting in mixed integer programming","volume":"4","author":"Gu","year":"2000","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2026.02.010_bib0029","series-title":"Technical Report","article-title":"Discrete Location Planning","author":"Haase","year":"2009"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0030","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.ejor.2013.08.009","article-title":"A comparison of linear reformulations for multinomial logit choice probabilities in facility location models","volume":"232","author":"Haase","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.010_bib0031","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1287\/opre.2021.0503","article-title":"Deepest cuts for benders decomposition","volume":"73","author":"Hosseini","year":"2025","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0032","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1177\/002224296402800307","article-title":"Defining and estimating a trading area","volume":"28","author":"Huff","year":"1964","journal-title":"Journal of Marketing"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2026.02.010_bib0033","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","article-title":"Separation algorithms for 0\u20131 knapsack polytopes","volume":"124","author":"Kaparis","year":"2010","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.02.010_bib0034","series-title":"Knapsack problems","author":"Kellerer","year":"2004"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0035","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.ejor.2011.06.036","article-title":"Sequential competitive location on networks","volume":"217","author":"Kress","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0036","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s00291-020-00605-w","article-title":"Preventive healthcare facility location planning with quality-conscious clients","volume":"43","author":"Krohn","year":"2021","journal-title":"OR Spectrum"},{"issue":"9","key":"10.1016\/j.ejor.2026.02.010_bib0037","doi-asserted-by":"crossref","first-page":"1726","DOI":"10.1057\/jors.2010.136","article-title":"A discrete competitive facility location model with variable attractiveness","volume":"62","author":"K\u00fc\u00e7\u00fckayd\u0131n","year":"2011","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0038","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11590-015-0930-3","article-title":"Improving solution of discrete competitive facility location problems","volume":"11","author":"Lan\u010dinskas","year":"2017","journal-title":"Optimization Letters"},{"issue":"23","key":"10.1016\/j.ejor.2026.02.010_bib0039","doi-asserted-by":"crossref","first-page":"17705","DOI":"10.1007\/s00500-020-05106-0","article-title":"Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations","volume":"24","author":"Lan\u010dinskas","year":"2020","journal-title":"Soft Computing"},{"key":"10.1016\/j.ejor.2026.02.010_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102541","article-title":"Profit-maximizing parcel locker location problem under threshold Luce model","volume":"157","author":"Lin","year":"2022","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0041","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ejor.2020.12.017","article-title":"Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule","volume":"293","author":"Lin","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2026.02.010_bib0042","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/ijoc.2022.0366","article-title":"Unified framework for choice-based facility location problem","volume":"36","author":"Lin","year":"2024","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0043","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2017.09.023","article-title":"Outer approximation and submodular cuts for maximum capture facility location problems with random utilities","volume":"266","author":"Ljubi\u0107","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0044","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1016\/j.ejor.2020.01.020","article-title":"A multicut outer-approximation approach for competitive facility location under random utilities","volume":"284","author":"Mai","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0045","series-title":"Frontiers in econometrics","first-page":"105","article-title":"Conditional logit analysis of qualitative choice behavior","author":"McFadden","year":"1974"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0046","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ejor.2023.03.008","article-title":"The follower competitive facility location problem under the nested logit choice rule","volume":"310","author":"M\u00e9ndez-Vogel","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0047","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1016\/j.ejor.2022.06.008","article-title":"Store location with multipurpose shopping trips and a new random utility customers\u2019 choice model","volume":"305","author":"M\u00e9ndez-Vogel","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0048","series-title":"North-holland mathematics studies","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0304-0208(08)73471-6","article-title":"Maximizing submodular set functions: Formulations and analysis of algorithms","volume":"vol. 59","author":"Nemhauser","year":"1981"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0049","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2013I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0050","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0377-2217(00)00169-7","article-title":"Static competitive facility location: An overview of optimisation approaches","volume":"129","author":"Plastria","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0051","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The Benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0052","series-title":"Wiley encyclopedia of operations research and management science","article-title":"Lifting techniques for mixed integer programming","author":"Richard","year":"2011"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0053","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1287\/opre.2021.2241","article-title":"A convex reformulation and an outer approximation for a large class of binary quadratic programs","volume":"71","author":"Rostami","year":"2023","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0054","doi-asserted-by":"crossref","unstructured":"Salant, Y., & Rubinstein, A. (2008). (A, f): Choice with frames,. 75, 1287\u20131296.","DOI":"10.1111\/j.1467-937X.2008.00510.x"},{"key":"10.1016\/j.ejor.2026.02.010_bib0055","series-title":"The paradox of choice: Why more is less","author":"Schwartz","year":"2004"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0056","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-022-01801-y","article-title":"Sequence independent lifting for a set of submodular maximization problems","volume":"196","author":"Shi","year":"2022","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.010_bib0057","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1111\/j.0022-4146.2004.00349.x","article-title":"Competitive multifacility location on networks: The (r\u2223xp)-medianoid problem","volume":"44","author":"Su\u00e1rez-Vega","year":"2004","journal-title":"Journal of Regional Science"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0058","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","article-title":"Technical note\u2013facets and strong valid inequalities for integer programs","volume":"24","author":"Wolsey","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.010_bib0059","series-title":"Integer Programming","author":"Wolsey","year":"2021"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.010_bib0060","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-016-1033-3","article-title":"Maximizing a class of submodular utility functions with constraints","volume":"162","author":"Yu","year":"2017","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.010_bib0061","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00291-011-0280-1","article-title":"The impact of client choice on preventive healthcare facility network design","volume":"34","author":"Zhang","year":"2012","journal-title":"OR Spectrum"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.010_bib0062","doi-asserted-by":"crossref","first-page":"4236","DOI":"10.1109\/TSG.2020.2991232","article-title":"Deployment of the electric vehicle charging station considering existing competitors","volume":"11","author":"Zhao","year":"2020","journal-title":"IEEE Transactions on Smart Grid"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:24:47Z","timestamp":1777566287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726001451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221726001451"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.010","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}