Blanquero Bravo, RafaelCarrizosa Priego, Emilio JoséNogales Gómez, AmayaPlastria, Frank2021-04-262021-04-262013-09-17Blanquero Bravo, R., Carrizosa Priego, E.J., Nogales Gómez, A. y Plastria, F. (2013). Single-facility huff location problems on networks. Annals of Operations Research, 222 (1), 175-195.0254-53301572-9338https://hdl.handle.net/11441/107835Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the problems are multimodal, a branch and bound algorithm is proposed, in which two different bounding strategies, based on Interval Analysis and DC optimization, are used and compared. Computational results are given for the two bounding procedures, showing that problems of rather realistic size can be solved in reasonable time.application/pdf20 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Huff location modelsLocation on networksDC optimizationInterval analysisinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/s10479-013-1445-x