{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:00Z","timestamp":1759847520874,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T00:00:00Z","timestamp":1444176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hungarian National Research, Development and Innovation Office - NKFIH","award":["PD115554"],"award-info":[{"award-number":["PD115554"]}]},{"name":"ICT COST Action","award":["TD1207"],"award-info":[{"award-number":["TD1207"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10898-015-0368-2","type":"journal-article","created":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T08:40:54Z","timestamp":1444207254000},"page":"233-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Solving a Huff-like Stackelberg location problem on networks"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0927-111X","authenticated-orcid":false,"given":"Bogl\u00e1rka","family":"G.-T\u00f3th","sequence":"first","affiliation":[]},{"given":"Krist\u00f3f","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"issue":"3","key":"368_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10898-008-9381-z","volume":"45","author":"R Blanquero","year":"2009","unstructured":"Blanquero, R., Carrizosa, E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45(3), 389\u2013402 (2009)","journal-title":"J. Glob. Optim."},{"key":"368_CR2","doi-asserted-by":"crossref","unstructured":"Blanquero, R., Carrizosa, E., Nogales-G\u00f3mez, A., Plastria, F.: Single-facility Huff location problems on networks. Ann. Oper. Res. 1(222), 175\u2013195 (2014)","DOI":"10.1007\/s10479-013-1445-x"},{"key":"368_CR3","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Springer, New York (2002)"},{"issue":"1\u20134","key":"368_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0966-8349(98)00054-0","volume":"6","author":"T Drezner","year":"1998","unstructured":"Drezner, T., Drezner, Z.: Facility location in anticipation of future competition. Locat. Sci. 6(1\u20134), 155\u2013173 (1998)","journal-title":"Locat. Sci."},{"key":"368_CR5","doi-asserted-by":"crossref","DOI":"10.1201\/9780203026922","volume-title":"Global Optimization Using Interval Analysis: Revised and Expanded","author":"E Hansen","year":"2003","unstructured":"Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)"},{"issue":"1","key":"368_CR6","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), 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"53","key":"368_CR7","first-page":"277","volume":"1","author":"O Kn\u00fcppel","year":"1993","unstructured":"Kn\u00fcppel, O.: PROFIL\/BIAS\u2014a fast interval library. Computing 1(53), 277\u2013287 (1993)","journal-title":"Computing"},{"issue":"3","key":"368_CR8","doi-asserted-by":"crossref","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., Kuban Alt\u0131nel, I.: 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":"3","key":"368_CR9","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/s10898-012-9893-4","volume":"56","author":"JL Redondo","year":"2013","unstructured":"Redondo, J.L., Arrondo, A.G., Fern\u00e1ndez, J., Garc\u00eda, I., Ortigosa, P.M.: A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand. J. Glob. Optim. 56(3), 983\u20131005 (2013)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"368_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/s11227-011-0605-5","volume":"58","author":"JL Redondo","year":"2011","unstructured":"Redondo, J.L., Fern\u00e1ndez, J., Garc\u00eda, I., Ortigosa, P.M.: Solving the facility location and design (1|1)-centroid problem via parallel algorithms. J. Supercomput. 58(3), 420\u2013428 (2011)","journal-title":"J. Supercomput."},{"issue":"1","key":"368_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10589-008-9170-0","volume":"45","author":"JL Redondo","year":"2010","unstructured":"Redondo, J.L., Fern\u00e1ndez, J., Garc\u00eda, I., Ortigosa, P.M.: Heuristics for the facility location and design (1|1)-centroid problem on the plane. Comput. Optim. Appl. 45(1), 111\u2013141 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"368_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ejor.2011.12.017","volume":"219","author":"N Saidani","year":"2012","unstructured":"Saidani, N., Chu, F., Chen, H.: Competitive facility location and design with reactions of competitors already in the market. Eur. J. Oper. Res. 219(1), 9\u201317 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"368_CR13","doi-asserted-by":"crossref","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.T., Fern\u00e1ndez, J., Pelegr\u00edn, B.: On a branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectr. 31, 679\u2013705 (2009)","journal-title":"OR Spectr."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0368-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0368-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0368-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T19:28:00Z","timestamp":1653247680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0368-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,7]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["368"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0368-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2015,10,7]]}}}