This paper addresses the location problem in emergency management with some constraints. Let G = (V, E) be an undirected graph with positive edge lengths and positive vertex weights. The traditional location problem in emergency management is to locate p facilities on vertices of G such that the sum of the weighted distances of the vertices to the closest facility is minimized. This paper improves the model by considering more practical constraints, in which we require that the p vertices in which the facilities are located must be connected, i.e. the subgraph induced by the p facility vertices must be connected.
展开▼
