Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/47423
DC FieldValueLanguage
dc.contributor.authorPelegrín, Blasen_US
dc.contributor.authorSuárez Vega, Rafael Ricardoen_US
dc.contributor.authorCano, Saúlen_US
dc.contributor.otherSuarez-Vega, Rafael-
dc.date.accessioned2018-11-23T13:27:06Z-
dc.date.available2018-11-23T13:27:06Z-
dc.date.issued2012en_US
dc.identifier.issn1134-5764en_US
dc.identifier.urihttp://hdl.handle.net/10553/47423-
dc.description.abstractAn isodistant point is any point on a network which is located at a predetermined distance from some node. For some competitive facility location problems on a network, it is verified that optimal (or near-optimal) locations are found in the set of nodes and isodistant points (or points in the vicinity of isodistant points). While the nodes are known, the isodistant points have to be determined for each problem. Surprisingly, no algorithm has been proposed to generate the isodistant points on a network. In this paper, we present a variety of such problems and propose an algorithm to find all isodistant points for given threshold distances associated with the nodes. The number of isodistant points is upper bounded by nm, where n and m are the number of nodes and the number of edges, respectively. Computational experiments are presented which show that isodistant points can be generated in short run time and the number of such points is much smaller than nm. Thus, for networks of moderate size, it is possible to find optimal (or near-optimal) solutions through the Integer Linear Programming formulations corresponding to the discrete version of such problems, in which a finite set of points are taken as location candidates.en_US
dc.languageengen_US
dc.publisher1134-5764
dc.relation.ispartofTOPen_US
dc.sourceTOP[ISSN 1134-5764],v. 20, p. 639-660en_US
dc.subject531004 Operaciones comerciales internacionalesen_US
dc.subject.otherLocalización de mercadosen_US
dc.subject.otherModelos económetricosen_US
dc.titleIsodistant points in competitive network facility locationen_US
dc.typeinfo:eu-repo/semantics/Articleen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11750-010-0148-6
dc.identifier.scopus84866563302-
dc.identifier.isi000308963100005-
dcterms.isPartOfTop
dcterms.sourceTop[ISSN 1134-5764],v. 20 (3), p. 639-660
dc.contributor.authorscopusid6602833240-
dc.contributor.authorscopusid56606361200-
dc.contributor.authorscopusid36173755400-
dc.description.lastpage660-
dc.description.firstpage639-
dc.relation.volume20-
dc.investigacionCiencias Sociales y Jurídicasen_US
dc.type2Artículoen_US
dc.identifier.wosWOS:000308963100005-
dc.contributor.daisngid1014317-
dc.contributor.daisngid2274874-
dc.contributor.daisngid8650289-
dc.identifier.investigatorRIDK-9982-2014-
dc.utils.revisionen_US
dc.contributor.wosstandardWOS:Pelegrin, B
dc.contributor.wosstandardWOS:Suarez-Vega, R
dc.contributor.wosstandardWOS:Cano, S
dc.date.coverdateEnero 2012
dc.identifier.ulpgces
dc.description.sjr0,523
dc.description.jcr0,843
dc.description.sjrqQ3
dc.description.jcrqQ3
dc.description.scieSCIE
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.author.deptGIR Técnicas estadísticas bayesianas y de decisión en la economía y empresa-
crisitem.author.deptIU de Turismo y Desarrollo Económico Sostenible-
crisitem.author.deptDepartamento de Métodos Cuantitativos en Economía y Gestión-
crisitem.author.orcid0000-0002-1926-3121-
crisitem.author.parentorgIU de Turismo y Desarrollo Económico Sostenible-
crisitem.author.fullNameSuárez Vega, Rafael Ricardo-
Appears in Collections:Artículos
Show simple item record

SCOPUSTM   
Citations

8
checked on Jun 26, 2022

WEB OF SCIENCETM
Citations

7
checked on Jan 10, 2021

Page view(s)

40
checked on May 21, 2022

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.