| dc.contributor.author | Espejo Miranda, Inmaculada | |
| dc.contributor.author | Páez Jiménez, Raúl | |
| dc.contributor.author | Puerto Albornoz, Justo | |
| dc.contributor.author | Rodríguez Chía, Antonio Manuel | |
| dc.contributor.other | Estadística e Investigación Operativa | es_ES |
| dc.date.accessioned | 2024-01-08T16:12:19Z | |
| dc.date.available | 2024-01-08T16:12:19Z | |
| dc.date.issued | 2003-07 | |
| dc.identifier.issn | 0305-0548 | |
| dc.identifier.uri | http://hdl.handle.net/10498/29911 | |
| dc.description.abstract | In 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.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Elsevier | es_ES |
| dc.source | Computers & Operations Research 2023, Vol. 159, pp. 525-553. | es_ES |
| dc.subject | Facility location problems | es_ES |
| dc.subject | Second order cone programming | es_ES |
| dc.subject | Neighborhoods | es_ES |
| dc.title | Facility location problems on graphs with non-convex neighborhoods | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.1016/j.cor.2023.106356 | |
| dc.relation.projectID | info: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.projectID | info: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.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RED2018-102363-T | es_ES |
| dc.relation.projectID | info: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ón | es_ES |
| dc.type.hasVersion | VoR | es_ES |