Burkard, Rainer; Fathali, Jafar - In: Mathematical Methods of Operations Research 65 (2007) 2, pp. 229-238
Let a connected undirected graph G = (V, E) be given. In the classical p-median problem we want to find a set X containing p points in G such that the sum of weighted distances from X to all vertices in V is minimized. We consider the semi-obnoxious case where every vertex has either a...
