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

Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research and computer science. In this note we consider the classical uncapacitated facility location problem and its “prize-collecting” variant introduced by Bäıou and Barahona, and show that the linear systems associated with these problems are totally dual integral (TDI) if ...

Given a set of client positions as input, facility location attempts to find positions for a set of facilities to optimize some objective function. In mobile facility location, clients undergo continuous motion with bounded velocity and the problem becomes maintaining the position of a mobile facility. This new area within the classical field of facility location is attractive for the many new ...

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

2

Evaluation and selection of concrete production facility location is an important strategic decision making problem for both public and private sector. The multi-dimensional, multi-criteria nature of the concrete production facility location problem limits the usefulness of any particular single objective model. In this study, social, economical, technological, environmental and transportation ...

Most existing facility location models assume that the cost is either a fixed setup or made up of and problem-specific concave submodular term. This structural property plays critical role in developing fast branch-and-price, Lagrangian relaxation, constant ratio approximation, conic integer programming reformulation approaches for these NP-hard problems. Many practical considerations complicat...

In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...

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