Results 11  20
of
6,376
LowerBounded Facility Location
 SODA 2008
, 2008
"... We study the lowerbounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the number of clients assigned to a facility in the case that this facility is opened. This problem was introduced independe ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We study the lowerbounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the number of clients assigned to a facility in the case that this facility is opened. This problem was introduced
Greedy strikes back: Improved facility location algorithms
 Journal of Algorithms
, 1999
"... A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing the co ..."
Abstract

Cited by 210 (11 self)
 Add to MetaCart
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well as transportation costs for distributing
Facility location: distributed approximation
 In Proceedings of the twentyfourth annual ACM symposium on Principles of distributed computing
, 2005
"... In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, achieves ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k
On the Asymmetric Connected Facility Location
"... Abstract. This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The underlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first l ..."
Abstract
 Add to MetaCart
Abstract. This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The underlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first
A new greedy approach for facility location problems
"... We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique of Lagra ..."
Abstract

Cited by 145 (9 self)
 Add to MetaCart
We present a simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 whereas the best previously known was 1.73. Furthermore, we will show that our algorithm has a property which allows us to apply the technique
Facility Location with Interference
, 2001
"... We consider a variant of the facility location problem with additional interference constraints of the form "not too many facilities can be close to a user". These constraints arise naturally in the placement of wireless access points or base stations. We model the interference in severa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider a variant of the facility location problem with additional interference constraints of the form "not too many facilities can be close to a user". These constraints arise naturally in the placement of wireless access points or base stations. We model the interference
2. Facility Location
"... The facility location problem has occupied a central place in operations research since the early 1960’s, as it models design decisions on the placement of factories, warehouses, schools, or hospitals to serve a set of customers efficiently. For an overview of previous work see the survey chapter by ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The facility location problem has occupied a central place in operations research since the early 1960’s, as it models design decisions on the placement of factories, warehouses, schools, or hospitals to serve a set of customers efficiently. For an overview of previous work see the survey chapter
Facility Location: Distributed Approximation
"... ABSTRACT In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k, ..."
Abstract
 Add to MetaCart
ABSTRACT In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a tradeoff between the amount of communication and the resulting approximation ratio. We give a distributed algorithm that, for every constant k
Faulttolerant facility location
 in Proceedings of the 14th Annual ACMSIAM Symposium on Discrete Algorithms
, 2003
"... We study a faulttolerant generalization of the classical uncapacitated facility location problem. We want to open a subset of facilities from a given set F and assign each client j in a given set D to rj ≥ 1 distinct open facilities so as to minimize the sum of the facility opening costs and the cl ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
We study a faulttolerant generalization of the classical uncapacitated facility location problem. We want to open a subset of facilities from a given set F and assign each client j in a given set D to rj ≥ 1 distinct open facilities so as to minimize the sum of the facility opening costs
Strategic facility location: A review
 European Journal of Operational Research
, 1998
"... Abstract Facility location decisions are a critical element in strategic planning for a wide range of private and public ®rms. The rami®cations of siting facilities are broadly based and longlasting, impacting numerous operational and logistical decisions. High costs associated with property acqui ..."
Abstract

Cited by 81 (7 self)
 Add to MetaCart
Abstract Facility location decisions are a critical element in strategic planning for a wide range of private and public ®rms. The rami®cations of siting facilities are broadly based and longlasting, impacting numerous operational and logistical decisions. High costs associated with property
Results 11  20
of
6,376