Puerto Albandoz, JustoTamir, ArieMesa López-Colmenar, Juan AntonioPérez Brito, Dionisio2022-11-032022-11-032008-08-06Puerto Albandoz, J., Tamir, A., Mesa López-Colmenar, J.A. y Pérez Brito, D. (2008). Center location problems on tree graphs with subtree-shaped customers. Discrete Applied Mathematics, 156 (15), 2890-2910. https://doi.org/10.1016/j.dam.2007.11.022.0166-218X1872-6771https://hdl.handle.net/11441/138658We consider the p-center problem on tree graphs where the customers are modeled as continua subtrees. We address unweighted and weighted models as well as distances with and without addends. We prove that a relatively simple modification of Handler’s classical linear time algorithms for unweighted 1- and 2-center problems with respect to point customers, linearly solves the unweighted 1- and 2-center problems with addends of the above subtree customer model. We also develop polynomial time algorithms for the p-center problems based on solving covering problems and searching over special domains.application/pdf20 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Facility locationSubtree-shaped customersTree graphsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1016/j.dam.2007.11.022