This paper is a theoretical and experimental study of two related facility location problems that emanated from networking. Suppose we are given a network modeled as a directed graph G = (V,A), together with (not-necessarily-disjoint) subsets C and F of V , where C is a set of customer locations and F is a set of potential facility locations (and typically C ⊆ F ). Our goal is to find a minimum...
