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...

In the obnoxious facility game with a set of agents in a space, we wish to design a mechanism, a decision-making procedure that determines a location of an undesirable facility based on locations reported by the agents, where we do not know whether the location reported by an agent is where exactly the agent exists in the space. For a location of the facility, the benefit of each agent is defin...

discrete facility location,   distribution center,   logistics,   inventory policy,   queueing theory,   markov processes, the distribution center location problem is a crucial question for logistics decision makers. the optimization of these decisions needs careful attention to the fixed facility costs, inventory costs, transportation costs and customer responsiveness. in this paper we study t...

Given a directed graph D = (V,A) we de ne its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call them facility location graphs since they arise from the classical uncapacitated facility location problem. In this paper we show that facilit...

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...

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.

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...

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) = ∑