Show simple item record

dc.contributor.authorEspejo Miranda, Inmaculada 
dc.contributor.authorPáez Jiménez, Raúl 
dc.contributor.authorPuerto Albornoz, Justo
dc.contributor.authorRodríguez Chía, Antonio Manuel 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2024-01-08T16:12:19Z
dc.date.available2024-01-08T16:12:19Z
dc.date.issued2003-07
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/10498/29911
dc.description.abstractIn this paper, we deal with some variants of classical facility location problems on graphs in which both the customers and the facilities belong to a non-necessarily convex neighborhood. Therefore, a point in each neighborhood representing the customer/facility has to be determined, and the customers have to be assigned to the facilities depending on a criterion. In particular, the p-median, the p-center, and the p-maximal covering versions of this problem on graphs are analyzed. An important difference with respect to their classical versions is that the lengths of the arcs depend on the location of the points chosen in the neighborhoods. Therefore, the lengths are not part of the input but part of the decision process. Assuming that the neighborhoods are Mixed-Integer Second Order Cone representable, different mixed-integer non-linear programming formulations are proposed for each one of the considered problems. Moreover, solution procedures providing bounds and a preprocessing phase are developed to reduce the number of variables and constraints of the proposed formulations. The results of an extensive computational experience are reported.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.sourceComputers & Operations Research 2023, Vol. 159, pp. 525-553.es_ES
dc.subjectFacility location problemses_ES
dc.subjectSecond order cone programminges_ES
dc.subjectNeighborhoodses_ES
dc.titleFacility location problems on graphs with non-convex neighborhoodses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/j.cor.2023.106356
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-114594GB-C21/ES/OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: LARGE SCALE NETWORK MODELS MEET OPTIMIZATION AND DATA SCIENCE TOOLS/ es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-114594GB-C22/ES/OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: DATA SCIENCE MEETS OPTIMIZATION AND NETWORK MODELS/ es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RED2018-102363-Tes_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2020-2023/TED2021-130875B-I00/ES/Optimización de recursos y de cadenas de producciónes_ES
dc.type.hasVersionVoRes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record