A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem

In the leader-follower, ( r | p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Networks and spatial economics Ročník 20; číslo 1; s. 73 - 98
Hlavní autoři:	Santos-Peñate, Dolores R., Campos-Rodríguez, Clara M., Moreno-Pérez, José A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2020 Springer Nature B.V
Témata:	Algorithms Civil Engineering Economic activity Economics Economics and Finance Formulations Game theory Iterative methods Kernels Linear programming Operations research Operations Research/Decision Theory Regional/Spatial Science Search algorithms Site selection medianoid Competitive location Kernel search centroid ( Leader-follower problem Linear programming \|
ISSN:	1566-113X, 1572-9427
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In the leader-follower, ( r \| p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for the leader and the follower are integrated into an algorithm which, in an iterative process, finds a solution by solving a sequence of these linear problems. We propose a matheuristic procedure that provides solutions for the leader via a kernel search algorithm. Taking into account binary and S-shaped customer choice rules, we present the computational results obtained and compare the exact algorithm with two versions of the kernel search procedure.
AbstractList	In the leader-follower, ( r \| p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for the leader and the follower are integrated into an algorithm which, in an iterative process, finds a solution by solving a sequence of these linear problems. We propose a matheuristic procedure that provides solutions for the leader via a kernel search algorithm. Taking into account binary and S-shaped customer choice rules, we present the computational results obtained and compare the exact algorithm with two versions of the kernel search procedure. In the leader-follower, (r\|p)-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services. This paper considers this competitive facility location problem in a discrete space. To solve it, the linear programming formulations for the leader and the follower are integrated into an algorithm which, in an iterative process, finds a solution by solving a sequence of these linear problems. We propose a matheuristic procedure that provides solutions for the leader via a kernel search algorithm. Taking into account binary and S-shaped customer choice rules, we present the computational results obtained and compare the exact algorithm with two versions of the kernel search procedure.
Author	Moreno-Pérez, José A. Santos-Peñate, Dolores R. Campos-Rodríguez, Clara M.
Author_xml	– sequence: 1 givenname: Dolores R. orcidid: 0000-0002-2694-7943 surname: Santos-Peñate fullname: Santos-Peñate, Dolores R. email: dr.santos@ulpgc.es organization: Instituto de Turismo y Desarrollo Económico Sostenible/Dpto de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de G.C – sequence: 2 givenname: Clara M. surname: Campos-Rodríguez fullname: Campos-Rodríguez, Clara M. organization: Instituto Universitario de Desarrollo Regional, Universidad de La Laguna – sequence: 3 givenname: José A. surname: Moreno-Pérez fullname: Moreno-Pérez, José A. organization: Instituto Universitario de Desarrollo Regional, Universidad de La Laguna
BookMark	eNp9kM1OwzAQhC1UJNrCC3CyxNlgx4mdHKvyK4JAapG4Wba7oanSuNguiLcnbZCQOPS0c5hvZ3dGaNC6FhA6Z_SSUSqvAmNUSEJZQWiRyoTIIzRkWSeKNJGDnRaCMMbfTtAohBWlTGRJNkSzCX4E30KDZ6C9XeInHZew9XWItcXR4ZlrPgHPl4Cv62A9RMAl6AV4cuuaxn2Bx6WzOtauxS_emQbWp-i40k2As985Rq-3N_PpPSmf7x6mk5LYlBaRLKjNBF1URifCCM1NbkQFmqasYJwvUmNooXPDOeQVz00uJWeadmYJItWZ4WN00e_dePexhRDVym1920WqJMmyQrKUyc6V9C7rXQgeKrXx9Vr7b8Wo2pWn-vJUV57al6d2UP4PsnXcPxm9rpvDKO_R0OW07-D_rjpA_QDIxYVo
CitedBy_id	crossref_primary_10_1111_itor_12945 crossref_primary_10_1007_s11590_025_02186_5 crossref_primary_10_1007_s00500_025_10407_3 crossref_primary_10_1016_j_cor_2023_106410 crossref_primary_10_1007_s11590_025_02205_5 crossref_primary_10_1016_j_cor_2022_105900 crossref_primary_10_1016_j_cor_2023_106261 crossref_primary_10_1371_journal_pone_0273123 crossref_primary_10_1007_s11067_019_09481_6 crossref_primary_10_1016_j_cor_2021_105292 crossref_primary_10_1016_j_cor_2023_106418 crossref_primary_10_1016_j_ejor_2022_01_031
Cites_doi	10.1016/j.ejor.2015.04.022 10.1007/s10898-013-0130-6 10.1007/s10479-014-1704-5 10.1007/s11067-018-9415-0 10.1007/978-3-319-44914-2_28 10.1134/S0005117914040080 10.1016/j.ejor.2017.08.041 10.1111/itor.12289 10.1007/s10898-015-0368-2 10.1016/S0377-2217(02)00445-9 10.1007/978-3-319-13111-5_14 10.1016/j.ejor.2015.09.008 10.1016/j.ejor.2012.07.042 10.1007/s11067-006-9013-4 10.1016/j.apm.2011.12.013 10.1111/j.1538-4632.1984.tb00799.x 10.1007/s11750-009-0117-0 10.1007/978-3-319-52654-6_1 10.1016/j.ejor.2014.04.007 10.1007/978-3-642-37838-6_7 10.1057/ori.2011.24 10.1016/j.tcs.2009.08.020 10.1007/978-3-319-52654-6_5 10.1016/j.cor.2015.04.012 10.3233/IDT-2012-0123 10.1007/s10472-014-9448-0 10.1007/978-3-642-12139-5_2 10.1007/s11067-006-9007-2 10.1016/j.cor.2006.05.006 10.1016/j.cor.2014.01.009 10.1007/978-3-319-21341-5 10.1016/j.tre.2016.07.002 10.1016/j.ejor.2011.06.036 10.1016/0165-0114(78)90029-5 10.1007/978-3-662-03280-0 10.1007/978-3-319-44914-2_29 10.1007/s10589-008-9170-0 10.1007/s10732-015-9282-5 10.1007/978-3-642-35582-0_17 10.1016/S0898-1221(03)90130-1 10.1007/s10479-015-1793-9 10.1007/s10732-012-9212-8 10.1016/S0305-0548(02)00024-2 10.1016/j.cor.2013.05.003 10.1109/ICSMC.2012.6378170 10.1016/j.compchemeng.2014.08.010 10.1007/s00291-008-0133-8 10.1023/A:1026150608051 10.15807/jorsj.44.390 10.1016/S0377-2217(98)00252-5 10.1111/itor.12268 10.1287/mnsc.1070.0752 10.1007/978-3-319-44914-2_26 10.1016/j.cie.2017.04.024 10.1007/s11067-013-9217-3 10.1080/07408170500216480
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC, part of Springer Nature 2019 Springer Science+Business Media, LLC, part of Springer Nature 2019.
Copyright_xml	– notice: Springer Science+Business Media, LLC, part of Springer Nature 2019 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2019.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AO 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s11067-019-09472-7
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Economics Sociology & Social History Computer Science
EISSN	1572-9427
EndPage	98
ExternalDocumentID	10_1007_s11067_019_09472_7
GrantInformation_xml	– fundername: Ministerio de Economía y Competitividad grantid: ECO2014-59067-P funderid: https://doi.org/10.13039/501100003329 – fundername: Fundación CajaCanarias funderid: https://doi.org/10.13039/100012000 – fundername: Ministerio de Economía y Competitividad grantid: TIN2015-70226-R funderid: https://doi.org/10.13039/501100003329
GroupedDBID	-57 -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 123 1N0 1SB 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5VS 67Z 6NX 7WY 8AO 8FE 8FG 8FL 8FW 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACDTI ACGFO ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBO EBS EBU EIOEI EJD EOH ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV LAK LLZTM M0C M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9G O9J OAM OVD P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 Q2X QOS QWB R89 R9I RIG RNI ROL RPX RSV RZC RZD S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TH9 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z81 ZL0 ZMTXR ~8M ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8FD 8FK AZQEC GNUQQ JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c409t-d0c560dfba26b6a3b8b6fea0419133d4bb09a8b33e8f38b87731a0a267e64a5b3
IEDL.DBID	RSV
ISICitedReferencesCount	14
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000524914500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1566-113X
IngestDate	Tue Nov 04 22:19:23 EST 2025 Tue Nov 18 22:17:07 EST 2025 Sat Nov 29 06:18:13 EST 2025 Fri Feb 21 02:33:09 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	medianoid Competitive location Kernel search centroid ( Leader-follower problem Linear programming \|
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c409t-d0c560dfba26b6a3b8b6fea0419133d4bb09a8b33e8f38b87731a0a267e64a5b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-2694-7943
PQID	2255971417
PQPubID	26113
PageCount	26
ParticipantIDs	proquest_journals_2255971417 crossref_primary_10_1007_s11067_019_09472_7 crossref_citationtrail_10_1007_s11067_019_09472_7 springer_journals_10_1007_s11067_019_09472_7
PublicationCentury	2000
PublicationDate	2020-03-01
PublicationDateYYYYMMDD	2020-03-01
PublicationDate_xml	– month: 03 year: 2020 text: 2020-03-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	A Journal of Infrastructure Modeling and Computation
PublicationTitle	Networks and spatial economics
PublicationTitleAbbrev	Netw Spat Econ
PublicationYear	2020
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	RoboredoMCPessoaAAA branch-and-bound algorithm for the discrete (r\|p)-centroid problemEur J Oper Res2013224101109 Fukuyama K, Kimura J, Ikeda Y (2012) Locating vendors in stackelberg competition in a linear monocentric city. In: IEEE international conference on systems man, and cybernetics, pp 2785–2790 GentileJPessoaAAPossMRoboredoMCInteger programming formulations for three sequential discrete competitive location problems with foresightEur J Oper Res20182653872881 TeraokaYOsumiSHohjoHSome stackelberg type location gameComputers and Mathematics with Applications20034611471154 Eiselt HA, Marianov V, Drezner T (2015) Competitive location models. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer, pp 365–398 Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (r\|p)-centroid problem. In: Talbi E (ed) Metaheuristics for bi-level optimization SCI, vol 482, pp 189–219 DavydovIKochetovYCarrizosaEA local search heuristic for the (r\|p)-centroid problem in the planeComput Oper Res201452334340 SasakiMCampbellJFKrishnamoorthyMErnstATA Stackelberg hub arc location model for a competitive environmentComput Oper Res2014472741 BerglundPGKwonCSolving a location problem of a Stackelberg firm competing with Cournot-Nash firmsNetw Spat Econ201414117132 MarianovVEiseltHAOn agglomeration in competitive location modelsAnn Oper Res201624613155 SpoerhaseJWirthHC(r\|p)-centroid problems on paths and treesTheor Comput Sci200941051285137 Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and exact methods for the discrete (r\|p)-centroid problem. In: Cowling P, Merz P (eds) Proceedings of the 10th European conference on evolutionary computation in combinatorial optimization. Springer, Berlin, pp 11–22 Drezner T, Drezner Z (2017) Leader-follower models in facility location. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 73–104 BiersingerBHuBRaidlGA hybrid genetic algorithm with solution archive for the discrete (r\|p)-centroid problemJ Heuristics201521391431 MillerTCFrieszTLTobinRLEquilibrium facility location on networks1996BerlinSpringer Santos-PeñateDRSuárez-VegaRDorta-GonzalezPThe leader-follower location modelNetw Spat Econ200774561 RhimHHoTHKarmarkarUSCompetitive location, production, and market selectionEur J Oper Res2003149211228 AlekseevaEKochetovYPlyasunovAAn exact method for the discrete (r\|p)-centroid problemJ Glob Optim2015633445460 EiseltHABhaduryJBurkeyMLAn optimization-based framework for modeling counterterrorism strategiesOR Insight2011261731 RedondoJLFernándezJGarcíaIOrtigosaPMHeuristics for the facility location and design (1\|1)-centroid problem on the planeComput Optim Appl2010451111141 BenatiSLaporteGTabu search algorithms for the (r\|xp)-medianoid and (r\|p)-centroid problemsLocat Sci19942193204 UnoTKatagiriHKosukecKA Stackelberg solution for fuzzy random competitive location problems with demand site uncertaintyIntelligent Decision Technologies2012616975 Borndörfer R, Omont B, Sagnol G, Swarat E (2012) A Stackelberg game to optimize the distribution of controls in transportation networks. In: Lecture notes of ICST, Proceedings of the 3rd international conference on game theory for networks (GAMENETS 2012), Vancouver, Canada, pp 24–26 MansiniRSperanzaMGHeuristic algorithms for the portfolio selection problem with minimum transaction lotsEur J Oper Res1999114219233 ZhangYSnyderLVRalphsTKXueZThe competitive facility location problem under disruption risksTransp Res E201693453473 Hooshmand F, Mirhassani SA (2018), An effective bilevel programming approach for the evasive flow capturing location problem. Networks and Spatial Economics, https://doi.org/10.1007/s11067-018-9415-0 KressDPeschESequential competitive location on networksEur J Oper Res20122173483499 QiMXiaMZhangYMiaoLCompetitive facility location problem with foresight considering service distance limitationsComput Ind Eng2017112483491 HendrixEMTOn competition in a Stackelberg location-design model with deterministic supplier choiceAnn Oper Res20162461930 Beresnev V, Melnikov A, et al. (2016) Facility location in unfair competition. In: Kochetov Y (ed) DOOR 2016, LNCS 9869, pp 325–335 AlekseevaEKochetovYTalbiEA matheuristic for the discrete bilevel problem with multiple objectives at the lower levelInt Trans Oper Res201724959981 Campos-RodríguezCMSantos-PeñateDRMoreno-PérezJAAn exact procedure and LP formulations for the leader-follower location problemTOP201018197121 Aras N, Küçükaydin H (2017) Bilevel models on the competitive facility location problem. In: Mallozzi L, D’Amato E, Pardalos PM (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 1–19 Hakimi SL Mirchandani PB, Francis RL (eds) (1990) Location with spatial interactions: competitive locations and games. Wiley, New York MajumderPLeadership and competition in networks supply chainsManag Sci200854611891204 Alexandris GP, Bardis NG (2012) A penetration strategy in a competitive environment, recent researches in applications of electrical and computer engineering. In: Proceedings of the 11th international conference on applications of electrical and computer engineering, pp 132–136 Karakitsiou A (2015) Modeling discrete competitive facility location, SpringerBriefs in Optimization, Springer AshtianiMGMakuiARamezanianRA robust model for a leader-follower competitive facility location problem in a discrete spaceAppl Math Model2013376271 SáizMEHendrixEMTFernándezJPelegrínBOn a branch-and-bound approach for a Huff-like Stackelberg location problemOR Spectr200931679705 MahmutogullariAIKaraBYHub location under competitionEur J Oper Res20152501214225 DreznerTDreznerZKalczynskiPA leader-follower model for discrete competitive facility locationComput Oper Res201564C5159 Davydov I, Coupechoux M, Iellamo S et al (2016) Tabu search approach for the Bi-Level competitive base station location problem. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 364–372 Santos-PeñateDRCampos-RodríguezCMMoreno-PérezJAThe generalized discrete centroid problemInt Trans Oper Res201926340363 BhaduryJEiseltHAJaramilloJHAn alternating heuristic for medianoid and centroid problems in the planeComput Oper Res2003304553565 GuastarobaGSperanzaMGKernel search for the capacitated facility location problemJ Heuristics2012186877917 Carrizosa E, Davydov I, Kochetov Y (2011) A new alternating heuristic for the (r\|p)-centroid problem on the plane. In: Operations research proceedings. Springer, pp 275–280 GhoshACraigCSA location-allocation model for facility planning in a competitive environmentGeogr Anal19841613951 Čvokić DD, Kochetov YA, Plyasunov AV, et al. (2016) A leader-follower hub location problem under fixed markups. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 350–363 MillerTCFrieszTLTobinRLKwonCReaction function based dynamic location modeling in Stackelberg-Nash-Cournot competitionNetw Spat Econ200777797 YueDYouFGame-theoretic modeling and optimization of multi-echelon supply chain design and operation under Stackelberg game and market equilibriumComput Chem Eng201471347361 GuastarobaGSperanzaMGA heuristic for BILP problems: the single source capacitated facility location problemEur J Oper Res2014238438450 SnyderLVFacility location under uncertainty: a reviewIIE Trans2006387547564 ZadehLAFuzzy sets as a basis for a theory of possibilityFuzzy Set Syst19781328 DavydovIAKochetovYAMladenovicNUrosevicDFast metaheuristics for the discrete (r\|p)-centroid problemAutom Remote Control2014754677687 Eiselt HA, Marianov V (2017) Asymmetries in competitive location models on the line. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118. Springer, pp 105–128 SasakiMFukushimaMStackelberg hub location problemJ Oper Res Soc Jpn2001444390402 BiersingerBHuBRaidlGModels and algorithms for competitive facility location problems with different customer behaviourAnn Math Artif Intell20167693119 PlastriaFVanhaverbekeLDiscrete models for competitive location with foresightComput Oper Res200835683700 AshtianiMGCompetitive location: a-state-of-art reviewInt J Ind Eng Comput20167118 García PérezMDPelegrín PelegrínBAll stackelberg location equilibria in the hotelling’s duopoly model on a tree with parametric pricesAnn Oper Res2003122177192 YangDJiaoJJiYDuGHeloPValeteAJoint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg gameEur J Oper Res2015246263280 G.-TóthBKovácsKSolving a Huff-like Stackelberg location problem on networksJ Glob Optim201664233247 G Guastaroba (9472_CR31) 2012; 18 J Bhadury (9472_CR12) 2003; 30 cr-split#-9472_CR19.1 E Alekseeva (9472_CR2) 2015; 63 cr-split#-9472_CR19.2 A Ghosh (9472_CR30) 1984; 16 T Uno (9472_CR58) 2012; 6 DR Santos-Peñate (9472_CR52) 2007; 7 B Biersinger (9472_CR14) 2015; 21 MD García Pérez (9472_CR28) 2003; 122 B Biersinger (9472_CR13) 2016; 76 9472_CR15 LV Snyder (9472_CR55) 2006; 38 9472_CR17 S Benati (9472_CR9) 1994; 2 I Davydov (9472_CR20) 2014; 52 TC Miller (9472_CR43) 1996 9472_CR6 E Alekseeva (9472_CR4) 2017; 24 HA Eiselt (9472_CR24) 2011; 26 P Majumder (9472_CR40) 2008; 54 TC Miller (9472_CR44) 2007; 7 9472_CR5 B G.-Tóth (9472_CR33) 2016; 64 CM Campos-Rodríguez (9472_CR16) 2010; 18 9472_CR3 9472_CR1 IA Davydov (9472_CR21) 2014; 75 M Qi (9472_CR46) 2017; 112 D Kress (9472_CR38) 2012; 217 AI Mahmutogullari (9472_CR39) 2015; 250 cr-split#-9472_CR10.2 PG Berglund (9472_CR11) 2014; 14 9472_CR27 cr-split#-9472_CR10.1 9472_CR26 MG Ashtiani (9472_CR8) 2013; 37 Y Teraoka (9472_CR57) 2003; 46 9472_CR22 9472_CR25 EMT Hendrix (9472_CR35) 2016; 246 V Marianov (9472_CR42) 2016; 246 cr-split#-9472_CR18.2 R Mansini (9472_CR41) 1999; 114 cr-split#-9472_CR18.1 ME Sáiz (9472_CR50) 2009; 31 J Gentile (9472_CR29) 2018; 265 T Drezner (9472_CR23) 2015; 64 G Guastaroba (9472_CR32) 2014; 238 D Yang (9472_CR59) 2015; 246 H Rhim (9472_CR48) 2003; 149 F Plastria (9472_CR45) 2008; 35 9472_CR37 9472_CR34 9472_CR36 J Spoerhase (9472_CR56) 2009; 410 DR Santos-Peñate (9472_CR51) 2019; 26 M Sasaki (9472_CR54) 2001; 44 MC Roboredo (9472_CR49) 2013; 224 M Sasaki (9472_CR53) 2014; 47 MG Ashtiani (9472_CR7) 2016; 7 JL Redondo (9472_CR47) 2010; 45 LA Zadeh (9472_CR61) 1978; 1 Y Zhang (9472_CR62) 2016; 93 D Yue (9472_CR60) 2014; 71
References_xml	– reference: AshtianiMGMakuiARamezanianRA robust model for a leader-follower competitive facility location problem in a discrete spaceAppl Math Model2013376271 – reference: AlekseevaEKochetovYTalbiEA matheuristic for the discrete bilevel problem with multiple objectives at the lower levelInt Trans Oper Res201724959981 – reference: RedondoJLFernándezJGarcíaIOrtigosaPMHeuristics for the facility location and design (1\|1)-centroid problem on the planeComput Optim Appl2010451111141 – reference: Eiselt HA, Marianov V, Drezner T (2015) Competitive location models. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer, pp 365–398 – reference: UnoTKatagiriHKosukecKA Stackelberg solution for fuzzy random competitive location problems with demand site uncertaintyIntelligent Decision Technologies2012616975 – reference: SáizMEHendrixEMTFernándezJPelegrínBOn a branch-and-bound approach for a Huff-like Stackelberg location problemOR Spectr200931679705 – reference: MansiniRSperanzaMGHeuristic algorithms for the portfolio selection problem with minimum transaction lotsEur J Oper Res1999114219233 – reference: MillerTCFrieszTLTobinRLEquilibrium facility location on networks1996BerlinSpringer – reference: Aras N, Küçükaydin H (2017) Bilevel models on the competitive facility location problem. In: Mallozzi L, D’Amato E, Pardalos PM (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 1–19 – reference: Fukuyama K, Kimura J, Ikeda Y (2012) Locating vendors in stackelberg competition in a linear monocentric city. In: IEEE international conference on systems man, and cybernetics, pp 2785–2790 – reference: TeraokaYOsumiSHohjoHSome stackelberg type location gameComputers and Mathematics with Applications20034611471154 – reference: SasakiMCampbellJFKrishnamoorthyMErnstATA Stackelberg hub arc location model for a competitive environmentComput Oper Res2014472741 – reference: Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (r\|p)-centroid problem. In: Talbi E (ed) Metaheuristics for bi-level optimization SCI, vol 482, pp 189–219 – reference: DavydovIAKochetovYAMladenovicNUrosevicDFast metaheuristics for the discrete (r\|p)-centroid problemAutom Remote Control2014754677687 – reference: YangDJiaoJJiYDuGHeloPValeteAJoint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg gameEur J Oper Res2015246263280 – reference: Carrizosa E, Davydov I, Kochetov Y (2011) A new alternating heuristic for the (r\|p)-centroid problem on the plane. In: Operations research proceedings. Springer, pp 275–280 – reference: GentileJPessoaAAPossMRoboredoMCInteger programming formulations for three sequential discrete competitive location problems with foresightEur J Oper Res20182653872881 – reference: GuastarobaGSperanzaMGKernel search for the capacitated facility location problemJ Heuristics2012186877917 – reference: MillerTCFrieszTLTobinRLKwonCReaction function based dynamic location modeling in Stackelberg-Nash-Cournot competitionNetw Spat Econ200777797 – reference: ZhangYSnyderLVRalphsTKXueZThe competitive facility location problem under disruption risksTransp Res E201693453473 – reference: Davydov I, Coupechoux M, Iellamo S et al (2016) Tabu search approach for the Bi-Level competitive base station location problem. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 364–372 – reference: Karakitsiou A (2015) Modeling discrete competitive facility location, SpringerBriefs in Optimization, Springer – reference: QiMXiaMZhangYMiaoLCompetitive facility location problem with foresight considering service distance limitationsComput Ind Eng2017112483491 – reference: SasakiMFukushimaMStackelberg hub location problemJ Oper Res Soc Jpn2001444390402 – reference: BenatiSLaporteGTabu search algorithms for the (r\|xp)-medianoid and (r\|p)-centroid problemsLocat Sci19942193204 – reference: GhoshACraigCSA location-allocation model for facility planning in a competitive environmentGeogr Anal19841613951 – reference: PlastriaFVanhaverbekeLDiscrete models for competitive location with foresightComput Oper Res200835683700 – reference: RoboredoMCPessoaAAA branch-and-bound algorithm for the discrete (r\|p)-centroid problemEur J Oper Res2013224101109 – reference: YueDYouFGame-theoretic modeling and optimization of multi-echelon supply chain design and operation under Stackelberg game and market equilibriumComput Chem Eng201471347361 – reference: García PérezMDPelegrín PelegrínBAll stackelberg location equilibria in the hotelling’s duopoly model on a tree with parametric pricesAnn Oper Res2003122177192 – reference: Hooshmand F, Mirhassani SA (2018), An effective bilevel programming approach for the evasive flow capturing location problem. Networks and Spatial Economics, https://doi.org/10.1007/s11067-018-9415-0 – reference: Čvokić DD, Kochetov YA, Plyasunov AV, et al. (2016) A leader-follower hub location problem under fixed markups. In: Kochetov Y (ed) DOOR 2016, LNCS 9869. Springer, pp 350–363 – reference: HendrixEMTOn competition in a Stackelberg location-design model with deterministic supplier choiceAnn Oper Res20162461930 – reference: ZadehLAFuzzy sets as a basis for a theory of possibilityFuzzy Set Syst19781328 – reference: G.-TóthBKovácsKSolving a Huff-like Stackelberg location problem on networksJ Glob Optim201664233247 – reference: Drezner T, Drezner Z (2017) Leader-follower models in facility location. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118, pp 73–104 – reference: AshtianiMGCompetitive location: a-state-of-art reviewInt J Ind Eng Comput20167118 – reference: SnyderLVFacility location under uncertainty: a reviewIIE Trans2006387547564 – reference: Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and exact methods for the discrete (r\|p)-centroid problem. In: Cowling P, Merz P (eds) Proceedings of the 10th European conference on evolutionary computation in combinatorial optimization. Springer, Berlin, pp 11–22 – reference: RhimHHoTHKarmarkarUSCompetitive location, production, and market selectionEur J Oper Res2003149211228 – reference: Alexandris GP, Bardis NG (2012) A penetration strategy in a competitive environment, recent researches in applications of electrical and computer engineering. In: Proceedings of the 11th international conference on applications of electrical and computer engineering, pp 132–136 – reference: Eiselt HA, Marianov V (2017) Asymmetries in competitive location models on the line. In: Mallozzi L, D’Amato E, Pardalos P M (eds) Spatial interaction models. Springer optimization and its applications, vol 118. Springer, pp 105–128 – reference: Borndörfer R, Omont B, Sagnol G, Swarat E (2012) A Stackelberg game to optimize the distribution of controls in transportation networks. In: Lecture notes of ICST, Proceedings of the 3rd international conference on game theory for networks (GAMENETS 2012), Vancouver, Canada, pp 24–26 – reference: BerglundPGKwonCSolving a location problem of a Stackelberg firm competing with Cournot-Nash firmsNetw Spat Econ201414117132 – reference: Hakimi SL Mirchandani PB, Francis RL (eds) (1990) Location with spatial interactions: competitive locations and games. Wiley, New York – reference: BiersingerBHuBRaidlGModels and algorithms for competitive facility location problems with different customer behaviourAnn Math Artif Intell20167693119 – reference: DreznerTDreznerZKalczynskiPA leader-follower model for discrete competitive facility locationComput Oper Res201564C5159 – reference: EiseltHABhaduryJBurkeyMLAn optimization-based framework for modeling counterterrorism strategiesOR Insight2011261731 – reference: MarianovVEiseltHAOn agglomeration in competitive location modelsAnn Oper Res201624613155 – reference: Beresnev V, Melnikov A, et al. (2016) Facility location in unfair competition. In: Kochetov Y (ed) DOOR 2016, LNCS 9869, pp 325–335 – reference: DavydovIKochetovYCarrizosaEA local search heuristic for the (r\|p)-centroid problem in the planeComput Oper Res201452334340 – reference: AlekseevaEKochetovYPlyasunovAAn exact method for the discrete (r\|p)-centroid problemJ Glob Optim2015633445460 – reference: BiersingerBHuBRaidlGA hybrid genetic algorithm with solution archive for the discrete (r\|p)-centroid problemJ Heuristics201521391431 – reference: Santos-PeñateDRCampos-RodríguezCMMoreno-PérezJAThe generalized discrete centroid problemInt Trans Oper Res201926340363 – reference: MahmutogullariAIKaraBYHub location under competitionEur J Oper Res20152501214225 – reference: Santos-PeñateDRSuárez-VegaRDorta-GonzalezPThe leader-follower location modelNetw Spat Econ200774561 – reference: GuastarobaGSperanzaMGA heuristic for BILP problems: the single source capacitated facility location problemEur J Oper Res2014238438450 – reference: MajumderPLeadership and competition in networks supply chainsManag Sci200854611891204 – reference: SpoerhaseJWirthHC(r\|p)-centroid problems on paths and treesTheor Comput Sci200941051285137 – reference: BhaduryJEiseltHAJaramilloJHAn alternating heuristic for medianoid and centroid problems in the planeComput Oper Res2003304553565 – reference: Campos-RodríguezCMSantos-PeñateDRMoreno-PérezJAAn exact procedure and LP formulations for the leader-follower location problemTOP201018197121 – reference: KressDPeschESequential competitive location on networksEur J Oper Res20122173483499 – volume: 246 start-page: 263 year: 2015 ident: 9472_CR59 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.04.022 – volume: 63 start-page: 445 issue: 3 year: 2015 ident: 9472_CR2 publication-title: J Glob Optim doi: 10.1007/s10898-013-0130-6 – volume: 246 start-page: 31 issue: 1 year: 2016 ident: 9472_CR42 publication-title: Ann Oper Res doi: 10.1007/s10479-014-1704-5 – ident: #cr-split#-9472_CR18.2 – ident: 9472_CR36 doi: 10.1007/s11067-018-9415-0 – ident: 9472_CR34 – ident: #cr-split#-9472_CR18.1 doi: 10.1007/978-3-319-44914-2_28 – volume: 75 start-page: 677 issue: 4 year: 2014 ident: 9472_CR21 publication-title: Autom Remote Control doi: 10.1134/S0005117914040080 – volume: 265 start-page: 872 issue: 3 year: 2018 ident: 9472_CR29 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.08.041 – volume: 26 start-page: 340 year: 2019 ident: 9472_CR51 publication-title: Int Trans Oper Res doi: 10.1111/itor.12289 – volume: 64 start-page: 233 year: 2016 ident: 9472_CR33 publication-title: J Glob Optim doi: 10.1007/s10898-015-0368-2 – volume: 149 start-page: 211 year: 2003 ident: 9472_CR48 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(02)00445-9 – ident: 9472_CR26 doi: 10.1007/978-3-319-13111-5_14 – volume: 250 start-page: 214 issue: 1 year: 2015 ident: 9472_CR39 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.09.008 – volume: 224 start-page: 101 year: 2013 ident: 9472_CR49 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2012.07.042 – volume: 7 start-page: 77 year: 2007 ident: 9472_CR44 publication-title: Netw Spat Econ doi: 10.1007/s11067-006-9013-4 – volume: 37 start-page: 62 year: 2013 ident: 9472_CR8 publication-title: Appl Math Model doi: 10.1016/j.apm.2011.12.013 – volume: 16 start-page: 39 issue: 1 year: 1984 ident: 9472_CR30 publication-title: Geogr Anal doi: 10.1111/j.1538-4632.1984.tb00799.x – volume: 18 start-page: 97 issue: 1 year: 2010 ident: 9472_CR16 publication-title: TOP doi: 10.1007/s11750-009-0117-0 – ident: 9472_CR6 doi: 10.1007/978-3-319-52654-6_1 – volume: 238 start-page: 438 year: 2014 ident: 9472_CR32 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2014.04.007 – ident: 9472_CR3 doi: 10.1007/978-3-642-37838-6_7 – volume: 26 start-page: 7 issue: 1 year: 2011 ident: 9472_CR24 publication-title: OR Insight doi: 10.1057/ori.2011.24 – volume: 410 start-page: 5128 year: 2009 ident: 9472_CR56 publication-title: Theor Comput Sci doi: 10.1016/j.tcs.2009.08.020 – volume: 2 start-page: 193 year: 1994 ident: 9472_CR9 publication-title: Locat Sci – ident: 9472_CR22 doi: 10.1007/978-3-319-52654-6_5 – volume: 64 start-page: 51 issue: C year: 2015 ident: 9472_CR23 publication-title: Comput Oper Res doi: 10.1016/j.cor.2015.04.012 – volume: 6 start-page: 69 issue: 1 year: 2012 ident: 9472_CR58 publication-title: Intelligent Decision Technologies doi: 10.3233/IDT-2012-0123 – volume: 76 start-page: 93 year: 2016 ident: 9472_CR13 publication-title: Ann Math Artif Intell doi: 10.1007/s10472-014-9448-0 – ident: 9472_CR1 doi: 10.1007/978-3-642-12139-5_2 – volume: 7 start-page: 45 year: 2007 ident: 9472_CR52 publication-title: Netw Spat Econ doi: 10.1007/s11067-006-9007-2 – volume: 35 start-page: 683 year: 2008 ident: 9472_CR45 publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.05.006 – volume: 47 start-page: 27 year: 2014 ident: 9472_CR53 publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.01.009 – ident: 9472_CR37 doi: 10.1007/978-3-319-21341-5 – volume: 93 start-page: 453 year: 2016 ident: 9472_CR62 publication-title: Transp Res E doi: 10.1016/j.tre.2016.07.002 – ident: 9472_CR5 – volume: 217 start-page: 483 issue: 3 year: 2012 ident: 9472_CR38 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2011.06.036 – ident: 9472_CR17 – volume: 1 start-page: 3 year: 1978 ident: 9472_CR61 publication-title: Fuzzy Set Syst doi: 10.1016/0165-0114(78)90029-5 – volume-title: Equilibrium facility location on networks year: 1996 ident: 9472_CR43 doi: 10.1007/978-3-662-03280-0 – ident: #cr-split#-9472_CR19.1 doi: 10.1007/978-3-319-44914-2_29 – volume: 45 start-page: 111 issue: 1 year: 2010 ident: 9472_CR47 publication-title: Comput Optim Appl doi: 10.1007/s10589-008-9170-0 – volume: 21 start-page: 391 year: 2015 ident: 9472_CR14 publication-title: J Heuristics doi: 10.1007/s10732-015-9282-5 – volume: 7 start-page: 1 year: 2016 ident: 9472_CR7 publication-title: Int J Ind Eng Comput – ident: 9472_CR15 doi: 10.1007/978-3-642-35582-0_17 – volume: 46 start-page: 1147 year: 2003 ident: 9472_CR57 publication-title: Computers and Mathematics with Applications doi: 10.1016/S0898-1221(03)90130-1 – volume: 246 start-page: 19 year: 2016 ident: 9472_CR35 publication-title: Ann Oper Res doi: 10.1007/s10479-015-1793-9 – volume: 18 start-page: 877 issue: 6 year: 2012 ident: 9472_CR31 publication-title: J Heuristics doi: 10.1007/s10732-012-9212-8 – volume: 30 start-page: 553 issue: 4 year: 2003 ident: 9472_CR12 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(02)00024-2 – ident: #cr-split#-9472_CR10.2 – volume: 52 start-page: 334 year: 2014 ident: 9472_CR20 publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.05.003 – ident: 9472_CR27 doi: 10.1109/ICSMC.2012.6378170 – volume: 71 start-page: 347 year: 2014 ident: 9472_CR60 publication-title: Comput Chem Eng doi: 10.1016/j.compchemeng.2014.08.010 – volume: 31 start-page: 679 year: 2009 ident: 9472_CR50 publication-title: OR Spectr doi: 10.1007/s00291-008-0133-8 – volume: 122 start-page: 177 year: 2003 ident: 9472_CR28 publication-title: Ann Oper Res doi: 10.1023/A:1026150608051 – volume: 44 start-page: 390 issue: 4 year: 2001 ident: 9472_CR54 publication-title: J Oper Res Soc Jpn doi: 10.15807/jorsj.44.390 – volume: 114 start-page: 219 year: 1999 ident: 9472_CR41 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(98)00252-5 – volume: 24 start-page: 959 year: 2017 ident: 9472_CR4 publication-title: Int Trans Oper Res doi: 10.1111/itor.12268 – volume: 54 start-page: 1189 issue: 6 year: 2008 ident: 9472_CR40 publication-title: Manag Sci doi: 10.1287/mnsc.1070.0752 – ident: #cr-split#-9472_CR10.1 doi: 10.1007/978-3-319-44914-2_26 – ident: 9472_CR25 – volume: 112 start-page: 483 year: 2017 ident: 9472_CR46 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2017.04.024 – volume: 14 start-page: 117 year: 2014 ident: 9472_CR11 publication-title: Netw Spat Econ doi: 10.1007/s11067-013-9217-3 – volume: 38 start-page: 547 issue: 7 year: 2006 ident: 9472_CR55 publication-title: IIE Trans doi: 10.1080/07408170500216480 – ident: #cr-split#-9472_CR19.2
SSID	ssj0016525
Score	2.263981
Snippet	In the leader-follower, ( r \| p )-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services.... In the leader-follower, (r\|p)-centroid or Stackelberg location problem, two players sequentially enter the market and compete to provide goods or services....
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	73
SubjectTerms	Algorithms Civil Engineering Economic activity Economics Economics and Finance Formulations Game theory Iterative methods Kernels Linear programming Operations research Operations Research/Decision Theory Regional/Spatial Science Search algorithms Site selection
SummonAdditionalLinks	– databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7o9ODF6VTcnJKDeNFi27RpepIxHYLbGKiwW2naBITRzq0b-N-bNOmKgrt4bhIK7-Xlez8_gOvUxWGahMxyEk6kg0I8i9mUqTAHIVJh0tguG4WHwXhMp9NwYgJuS1NWWdnE0lCneaJi5PduiX0dzwke5p-WYo1S2VVDobELewrZqJK-kd3fZBGIX5KuKhfFchw8NU0zunVOzU6TjrQqGPICiTJ_Pkw12vyVIC3fnUHzv398BIcGcaKeVpFj2OFZC5oVmwMyl7sFnU3vCrpBumsX6SEiXyfw2kMvfJHxGdL1yWikkONKj3lGRS43zNYcSaVDjx_SEkkojjR7pzWQmqao2NAw1-FBNNEkNqfwPnh66z9bho_BSqQXWFipnUh8lAoWu4SRGDPKiOCx7UmfD-PUY8wOY8ow5lRgymgQYCe25eKAEy_2GT6DRpZn_BxQ7AvfFb7gmDBPqFSix_yEciZY6Lpp2AanEkaUmGHlijNjFtVjlpUAIynAqBRgFLThdrNnrkd1bF3draQWmWu7jGqRteGuknv9-e_TOttPu4ADV_npZe1aFxrFYsUvYT9ZFx_LxVWptN-VM_CW priority: 102 providerName: ProQuest
Title	A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem
URI	https://link.springer.com/article/10.1007/s11067-019-09472-7 https://www.proquest.com/docview/2255971417
Volume	20
WOSCitedRecordID	wos000524914500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9427 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016525 issn: 1566-113X databaseCode: RSV dateStart: 20010301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD54A31xOhWnc-RBfNFC27Rp-uhtCLtQ5m36Upo2hcHYZDfw33vStCuKCvoSKLlQkpPkfDmXD-A0samfxL4wrFgyBCjMMYTJhXrmYAwFJonMLFC47XW7vN_3gzwobFp4uxcmyeykLoPdVLYzhL7KxcfxUC9chXW87rgibOjdPy1tB8zNqFYVMDEsi_bzUJnvx_h8HZU65hezaHbbNCv_-88d2M61S3KpxWEXVuSoCpWCuYHkG7kKm0U88rQKR8uYFXJGdLQu0clD3vfg_pK05GQkh0T7JZOO0hjnOr0zmY2xw3AhCQobuRngCYQqONGsnUYTJUxRsJH2WD8LkkCT1-zDY_P24frOyHkYjBjR38xIzBj1oiQVkc0Ei6jggqUyMh3EepQmjhCmH3FBqeQp5YJ7HrUiExt7kjmRK-gBrI3GI3kIJHJT107dVFImnFSZEB3hxlyKVPi2nfg1sIrlCOM8SbniyhiGZXplNb0hTm-YTW_o1eB82edNp-j4tXW9WOUw367T0M6AleVYWH1RrGpZ_fNoR39rfgxbtsLrmQ9bHdZmk7k8gY14MRtMJw1Y9Z5fGrB-ddsNevjV8gwsO-Y1loH72sjE_AMWQ-_i
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9swFH9igMQuwPgQBcZ8gF2YRWI7tnNAExpUoJYKCZB6y-LEkSpVLesX4p_a37jnOGk1pHHjsHNsS0l-7_l9_wCOc8bjPIsNDTMr0UGRgppAGxfmkBIBk6dB2SjcVp2O7nbjuyX4XffCuLLKWieWijofZi5GfsZK2zcUofr-9Is61iiXXa0pNDwsWvblGV228fnNJf7fE8aaVw8_rmnFKkAz9GUmNA8yvOXzwqRMGplyo40sbBoI9Fw4z4UxQZxqw7nVBddGK8XDNMDFykqRRobjuR9gRXCtnFy1FJ1nLWRUkrw6l4iGIe9WTTq-Vc_NakPH3RUoCYVW7d8X4cK6fZWQLe-55sb_9oU2Yb2yqMmFF4FPsGQHW7BRs1WQSnltwf68N4d8Jb4rmfghKS_bcH9BWnY0sH3i66_JrbOMp36MNZkMcUN_ZgkKFbnsoaZFV4N4dlLaRElyVHOkPfThT3LnSXp24PFd3nsXlgfDgd0DkkZFxIqosFwaUbhUqTBRpq0pTMxYHjcgrH9-klXD2B0nSD9ZjJF2gEkQMEkJmEQ14HS-58mPInlz9WGNkqRSS-NkAZEGfKtxtnj879P23z7tC6xdP9y2k_ZNp3UAH5mLSZR1eoewPBlN7WdYzWaT3nh0VAoMgZ_vjb8_u4JOBw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NS8MwFH_4hXhxOhWnU3NQL1pskzZtDyLiHMrmGKgwvNSmTUAYm25T8V_zr_OlaTcU3M2D5yaBtr_38r5_APspZWGahMJyEsnRQeGuJexA6DAH5wiYNLazRuGm32oFnU7YnoHPohdGl1UWOjFT1Gk_0THyE5rZvo7r-CcqL4to1-pnzy-WZpDSmdaCTsNApCE_3tF9G55e1_BfH1Bav7y7uLJyhgErQb9mZKV2gjd-qkRMueAxE4HgSsa2i14MY6krhB3GgWBMBooFIvB95sQ2LvYld2NPMDx3FuZ99DF1OWHbexhnMLiXEb5q98hyHNbJG3ZM256e24ZOvC5Wcn20cL9fihNL90dyNrvz6qX__LVWYDm3tMm5EY1VmJG9MpQKFguSK7UybI17dsghMd3KxAxP-ViD23PSkIOe7BJTl01utMX8asZbk1EfN3TfJEFhI7Un1MDoghDDWmrVUcI0BR1p9k1YlLQNec863P_Je2_AXK_fk5tAYk95VHlKMi5cpVOorvCSQAolQkrTsAJOAYQoyYe0a66QbjQZL63BEyF4ogw8kV-Bo_GeZzOiZOrqaoGYKFdXw2gClwocF5ibPP79tK3pp-3BIsIual63GtuwRHWoIivfq8LcaPAqd2AheRs9DQe7mewQePxr-H0BeQZXKw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Kernel+Search+Matheuristic+to+Solve+The+Discrete+Leader-Follower+Location+Problem&rft.jtitle=Networks+and+spatial+economics&rft.au=Santos-Pe%C3%B1ate%2C+Dolores+R.&rft.au=Campos-Rodr%C3%ADguez%2C+Clara+M.&rft.au=Moreno-P%C3%A9rez%2C+Jos%C3%A9+A.&rft.date=2020-03-01&rft.pub=Springer+US&rft.issn=1566-113X&rft.eissn=1572-9427&rft.volume=20&rft.issue=1&rft.spage=73&rft.epage=98&rft_id=info:doi/10.1007%2Fs11067-019-09472-7&rft.externalDocID=10_1007_s11067_019_09472_7
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1566-113X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1566-113X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1566-113X&client=summon