The location problem of interconnected facilities on the line with forbidden gaps is considered. The located facilities are connected among themselves and with gaps. Location in forbidden gaps is not allowed. It is need to minimize the total cost of connections between facilities and between facilities and gaps. It is known that the initial continuous problem is reduced to series discrete subpr...

Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists of optimally locating facilities and allocating customers to facilities so as to minimize the total cost. The standard approach to solving location-allocation problems is to model alternative location sites and customers as discrete entiti...

The Facility Location Problem (FLP) requires locating facilities in order to optimize some performance criteria. This problem occurs in many practical settings where facilities provide a service, such as the location of plants, bus-stops, fire stations, etc. Particularly, we deal with the continuous version of location problem where facilities have to be located in an Euclidean plane. This pape...

This paper proposes a new model of facility location problem referred to as k-product uncapacitated facility location problem with multi-type clients. The k-product uncapacitated facility location problem with multitype clients consists of two set of sites, one is the set of demand points where clients are located and the other is the set of sites where facilities of unlimited capacities can be...

We present two capacity choice scenarios for the socially optimal location of facilities with fixed servers, stochastic demand and congestion. Walk-in health clinics, motor vehicle inspection stations, automobile emissions testing stations, and internal service systems are motivating examples of such facilities. The choice of locations for such facilities influences not only distances for users...

In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns the robust fault-tolerant version of the uncapacitated facility location problem (RFTFL). In this pr...

The recent proliferation of facility-siting conflicts underscores the need for new analytical techniques in which the external effects associated with noxious facilities are considered explicitly. In general, in prescriptive facility-location models it is assumed that having populations "closer", as characterized by transport or accessibility advantages, is better for desirable facilities, but,...