Showing 1 - 10 of 612
The problem of locating facilities in a feasible area covering some parts of network links within a given radius is analyzed. The feasible area can be the interior (convex hull of the nodes) of a planar network or any union of convex polygons. Both minimization and maximization of coverage are...
Persistent link: https://www.econbiz.de/10011154868
Persistent link: https://www.econbiz.de/10003668362
Persistent link: https://www.econbiz.de/10007391466
Persistent link: https://www.econbiz.de/10007274577
Persistent link: https://www.econbiz.de/10007744939
Persistent link: https://www.econbiz.de/10007777065
Persistent link: https://www.econbiz.de/10005095016
Persistent link: https://www.econbiz.de/10005271568
Persistent link: https://www.econbiz.de/10003786726
Persistent link: https://www.econbiz.de/10003836672