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)
引用格式
Xingze Dai (2026). Weber Problem Solver (https://github.com/Xngzdai/Weber_Problem_Solver/releases/tag/v1.0), GitHub. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0 |
要查看或报告此来自 GitHub 的附加功能中的问题,请访问其 GitHub 存储库。
要查看或报告此来自 GitHub 的附加功能中的问题,请访问其 GitHub 存储库。
