Sciweavers

36 search results - page 4 / 8
» Capacitated facility location problem with general setup cos...
Sort
View
TCS
2010
13 years 5 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
13 years 9 months ago
Fault-tolerant facility location
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...
Chaitanya Swamy, David B. Shmoys
PODC
2005
ACM
14 years 1 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
EOR
2006
76views more  EOR 2006»
13 years 7 months ago
Location of slaughterhouses under economies of scale
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
John v. d. Broek, Peter Schütz, Leen Stougie,...