Show simple item record

dc.contributor.authorBaldomero Naranjo, Marta 
dc.contributor.authorKalcsics, Jörg
dc.contributor.authorRodríguez Chía, Antonio Manuel 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2024-03-08T08:35:39Z
dc.date.available2024-03-08T08:35:39Z
dc.date.issued2024-01-17
dc.identifier.issn0028-304
dc.identifier.urihttp://hdl.handle.net/10498/31336
dc.description.abstractIn this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove that this problem is solvable in polynomial time. The cases of star and path networks combined with different assumptions for the model parameters are analysed. In particular, we obtain that the problem on star networks is solvable in (Formula presented.) time for uniform weights and NP-hard for non-uniform weights. On paths, the single facility problem is solvable in (Formula presented.) time, while the (Formula presented.) -facility problem is NP-hard even with uniform costs and upper bounds (maximal upgrading per edge), as well as, integer parameter values. Furthermore, a pseudo-polynomial algorithm is developed for the single facility problem on trees with integer parameters.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherWileyes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceNetworks (2024)es_ES
dc.subjectcomplexityes_ES
dc.subjectcovering problemses_ES
dc.subjectlocationes_ES
dc.subjectnetworkses_ES
dc.subjectupgrading problemses_ES
dc.titleOn the complexity of the upgrading version of the maximal covering location problemes_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.description.physDesc15 páginases_ES
dc.identifier.doi10.1002/net.22207
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/TED2021-130875B-100/ES/PROCESOS DE IMPREGNACIÓN DE POLIMEROS Y MATRICES POROSAS MEDIANTE FLUIDOS SUPERCRÍTICOS/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-T/ES/RED ESPAÑOLA DE CANALES IONICOS/es_ES
dc.type.hasVersionVoRes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
This work is under a Creative Commons License Attribution-NonCommercial-NoDerivatives 4.0 Internacional