1 The Uncapacitated Facility Location Problem Input: a set D of demands (or clients); a set F of facilities; for each client j ∈ D and facility i ∈ F , there is a cost cij of assigning client j to facility i; and there is a cost fi associated with each facility i ∈ F . Output: Choose a subset of facilities F ′ ⊆ F which minimizes the total cost of facilities in F ′ plus the total cost of assign...

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time from the clients to the facility, using the L1 or Manhattan metric. The rapid transit line is given by a segment with any length and orientation, and is an alternative transportation line that ...

1 In this paper we study a facility location problem in the plane in which a single point (facility) 2 and a rapid transit line (highway) are simultaneously located in order to minimize the total travel 3 time of the clients to the facility, using the L1 or Manhattan metric. The rapid transit line is 4 represented by a line segment with fixed length and arbitrary orientation. The highway is an ...

We present e cient algorithms for several instances of the following facility location problem. (Facilities and demand sites are represented as points in the plane.) Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must con...

We propose models to investigate effectiveness-equity tradeoffs in tree network facility location problems. We use the commonly used median objective as a measure of effectiveness, and the Gini index as a measure of (in)equity, and formulate bicriteria problems involving these objectives. We develop procedures to identify an efficient set of solutions to these problems, analyze the complexity o...

Facility Location Problems have always been studied with the assumption that the environment in the network is static and does not change over time. In practice, however, the environment is usually dynamic and we must consider the facility location in a global view. In this paper, we impose the following additional constraints on input facilities: the total number of facilities to be placed is ...

In this article we propose, for any > 0, a 2(1+ )-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred costs are the expected transportation costs from the demand points to the facilities, the operating costs of the facil...

The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a gen...

Harvesting plans for Canadian logging companies tend to cover wider territories than before. Long transportation distances for the workers involved in logging activities have thus become a significant issue. Often, cities or villages to accommodate the workers are far away. A common practice is thus to construct camps close to the logging regions, containing the complete infrastructure to host ...