A multifacility location problem on median spaces

AbstractThis paper is concerned with the problem of locating n new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexity of this algorithm for median graphs and networks and for finite median spaces with ¦V¦points is O(¦V¦3 + ¦V¦ψ(n)), where ψ(n) is the complexity of the applied maximum-flow algorithm. For a simple rectilinear polygon P with N edges and equipped with the rectilinear distance the analogical algorithm requires O(N + k(logN + logk + ψ(n))) time and O(N + kψ(n)) time in the case of the vertex-restricted multifacility location problem

Multifacility location with imprecise data

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science, Bilkent Univ., 1994.Thesis (Master's) -- Bilkent University, 1994.Includes bibliographical references leaves 75-78.Locational decisions often suffer from lack of precise data. In this study, we consider a class of multifacility location problems where the demands of existing and new facilities are unknown, with a known set of possible realizations. The set may be finite or infinite. In the latter case, the data is assumed to be of interval type. We use various criteria to evaluate candidate solutions to these problems and build a framework for decision making.Demir, Muhittin HakanM.S