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 lift known facets of the related Steiner arborescence and of the facility location polytope. Then we describe...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

This paper focuses on a new Stackelberg location problem on a network with demands whose weights are given uncertainly and vaguely. By representing them as fuzzy random variables, the optimal location problem can be formulated as a fuzzy random programming problem for finding Stackelberg equilibrium. By using both their α-level sets for fuzziness and their satisfaction level for a given probabi...

A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.

In this paper we formalize and initiate the study of heterogeneous k-facility location without money, a problem akin to the classical k-facility location problem but encompassing a richer model and featuring multi-parameter agents. In particular, we consider truthful mechanisms without money for the problem in which heterogeneous (i.e. serving different purposes) facilities have to be located a...

“Green logistics” is a popular catchword, not only in public and among companies, but also in academia. In this paper we apply the concept of green logistics to the facility location problem: Optimizing the locations of facilities in the general pmedian model. This is based on CO2 emissions generated through transportation rather than traditional cost measures, such as physical transportation c...

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