In this paper, we consider the fault-tolerant facility location problem with submodular penalties that is a common generalization of the fault-tolerant facility location problem and the facility location problem with submodular penalties. For this problem, we present a combinatorial 3 ·HR-approximation algorithm, where R is the maximum connectivity requirement and HR is the R-th harmonic number...

P-median problem refers to decrease the average distances in facility location problem. It is the burning issue in facility location problem, the prominent area of research in present scenario. Through this paper, efforts are made to highlight the different aspects of p-median solving techniques. Different techniques are analyzed and compared to reveal the best results.

The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑

We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at two given points. In other words, given a set S of points in the plane and a positive value l0, we want to compute an anchored 1-corner polygonal chain having length at most l0 such that the minimum distance to the point...

We propose a cost-sharing scheme for the k-level facility location game that is cross-monotonic, competitive, and 6-approximate cost recovery. This extends the recent result for the 1-level facility location game of Pál and Tardos.

Article history: Received 16 April 2009 Received in revised form 29 January 2010 Available online 18 February 2010

In this paper, we deal with a facility location problem where we build new facilities or close down already existing facilities at two different distribution levels over a given time horizon. In addition, we allow to carry over stock in warehouses between consecutive periods. Our model intends to minimize the total costs, including transportation and inventory holding costs for products as well...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...