Showing 81 - 90 of 221
We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.
Persistent link: https://www.econbiz.de/10009218139
Persistent link: https://www.econbiz.de/10005779405
Persistent link: https://www.econbiz.de/10005042856
Persistent link: https://www.econbiz.de/10010703915
Persistent link: https://www.econbiz.de/10010704181
Persistent link: https://www.econbiz.de/10010717208
Persistent link: https://www.econbiz.de/10011037631
Persistent link: https://www.econbiz.de/10005625903
Persistent link: https://www.econbiz.de/10005474866
Persistent link: https://www.econbiz.de/10005478950