Minimizing movement in mobile facility location problems
نویسندگان
چکیده
منابع مشابه
Reverse facility location problems
In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...
متن کاملLocal-Search based Approximation Algorithms for Mobile Facility Location Problems
We consider the mobile facility location (MFL) problem. We are given a set of facilities and clients located in a common metric space G = (V, c). The goal is to move each facility from its initial location to a destination (in V ) and assign each client to the destination of some facility so as to minimize the sum of the movement-costs of the facilities and the client-assignment costs. This abs...
متن کاملHardness of Facility Location Problems
1.2 Hardness of k-median Theorem 1. It is hard to approximate k-median within 1+ 2 e1/c for any c < 1. This theorem is equivalent to the 1− 1/e− hardness shown in [2] and follows from a standard reduction from set cover. The main idea is to take an approximation algorithm for k-median, and use it to obtain a partial set cover. Then repeat this process, again partially covering the remaining ite...
متن کاملMulti-level facility location problems
We conduct a comprehensive review on multi-level facility location problems which extend several classical facility location problems and can be regarded as a subclass within the well-established field of hierarchical facility location. We first present the main characteristics of these problems and discuss some similarities and differences with related areas. Based on the types of decisions in...
متن کاملUncapacitated Facility Location Problems: Contributions
The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2011
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1978782.1978783