Updated 17 Jan 2021
In geometry, the Weber problem, named after Alfred Weber, is one of the most famous problems in location theory. It requires finding a point in the plane that minimizes the sum of the transportation costs from this point to n destination points, where different destination points are associated with different costs per unit distance. (Cited from https://en.wikipedia.org/wiki/Weber_problem#cite_note-9)
Xingze Dai (2021). Weber Problem Solver (https://github.com/Xngzdai/Weber_Problem_Solver/releases/tag/v1.0), GitHub. Retrieved .
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!