New for: D1, D2, D3, D4, D5
abstract: The problem of locating facilities so as to serve clients in the most efficient manner while minimizing the total cost of the location has been well researched in the operations research community. When facilities have hard capacity constraints the only approximation algorithms that are known rely on local search. In this talk I will present algorithms for the case of uniform capacities, for non-uniform capacities and for universal facility location.