Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...

Many self-configuration problems that occur in sensor networks, such as clustering or operator placement for in-network data aggregation, can be modeled as facility location problems. Unfortunately, existing distributed facility location algorithms are hardly applicable to multi-hop sensor networks. Based on an existing centralized algorithm, we therefore devise equivalent distributed versions ...

Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research and computer science. In this paper we consider the classical uncapacitated facility location problem and its “prize-collecting” variant introduced by Bäıou and Barahona, and we show that the linear systems associated with these problems are totally dual integral if an...

Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research and computer science. In this note we consider the classical uncapacitated facility location problem and its “prize-collecting” variant introduced by Bäıou and Barahona, and show that the linear systems associated with these problems are totally dual integral (TDI) if ...

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...