Weber Problem Solver

This project is a realization of generalizing Weiszfeld's algorithm for the unweighted problem proposed by Kuhn and Kuenne in 1962.

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)