Weber Problem Solver
This project is a realization of generalizing Weiszfeld's algorithm for the unweighted problem proposed by Kuhn and Kuenne in 1962.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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)
Cite As
Xingze Dai (2026). Weber Problem Solver (https://github.com/Xngzdai/Weber_Problem_Solver/releases/tag/v1.0), GitHub. Retrieved .
General Information
- Version 1.0 (15.5 KB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0 |
To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.
