151 search results - page 9 / 31 » Minimizing Movement in Mobile Facility Location Problems |
AICCSA
2001
IEEE
15 years 1 months ago
2001
IEEE
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
COR
2007
14 years 9 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
DAM
2000
14 years 9 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
COR
2006
14 years 9 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
IDEAS
2003
IEEE
15 years 2 months ago
2003
IEEE
We characterize the dynamic data management problem for location based services(LBS) in mobile environments and devise a cost model for servicing both location independent and loc...