RT journal article
T1 Facility location problems on graphs with non-convex neighborhoods
A1 Espejo Miranda, Inmaculada
A1 Páez Jiménez, Raúl
A1 Puerto Albornoz, Justo
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Facility location problems
K1 Second order cone programming
K1 Neighborhoods
AB In this paper, we deal with some variants of classical facility location problems on graphs in which boththe customers and the facilities belong to a non-necessarily convex neighborhood. Therefore, a point in eachneighborhood representing the customer/facility has to be determined, and the customers have to be assignedto the facilities depending on a criterion. In particular, the p-median, the p-center, and the p-maximal coveringversions of this problem on graphs are analyzed. An important difference with respect to their classical versionsis 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 areMixed-Integer Second Order Cone representable, different mixed-integer non-linear programming formulationsare proposed for each one of the considered problems. Moreover, solution procedures providing bounds anda preprocessing phase are developed to reduce the number of variables and constraints of the proposedformulations. The results of an extensive computational experience are reported.
PB Elsevier
SN 0305-0548
YR 2003
FD 2003-07
LK http://hdl.handle.net/10498/29911
UL http://hdl.handle.net/10498/29911
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026