We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...

Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are repo...

This paper presents a novel reliable hierarchical location-allocation model where facilities are subject to the risk of disruptions. Based on the relationship between various levels of system, a multi-level multi-flow hierarchy is considered. The heterogeneous probabilistic disruptions are investigated in which the constructed facilities have different site-dependent and independent failure rat...

Supply chain decision problems are becoming more complex with the globalization of businesses spanning several international borders. One such strategic decision problem is the location selection problem, which determines an optimal location to build a new facility. This requires multicriteria evaluation of N alternate locations with respect to M location attributes. The alternate locations cou...

We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents’ locations to a set of facilities. The agents seek to minimize their connection cost, namely the distance of their true location to the nearest facility, and may misreport their location. We are interested in mechanisms that are...

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

Purpose Companies could gain competitive advantage through the supply chain network. Especially facility location represent possible source of cost and service performance improvement. The goal of this article is to explore and expose what could be the facility location key performance indicators. Design/methodology/approach A literature review is conducted to examine research relating to suppl...