In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
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 ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...