Resolution of the min-sum location problem, also known as Fermat--Weber problem. The min-sum location problem look for a point such that the weighted sum of the distances to the demand points are minimized.
To start input values for parameters, select an action, and press "Do!". Select the tab to show. You can enter new values and the results will be updated automatically.