A 3-approximation algorithm for the facility location problem with uniform capacities
Math. Program., pp. 527-547, 2013.
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of add, delete and swap and prove that any locally optimum solution is no more than 3 times the global optimum. This improves on a result of Chudak and Williamson wh...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)