Local solutions of the multi-source Weber problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- A fast algorithm for the rectilinear distance location problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms
- An easy path to convex analysis and applications
- Clustering via d. c. optimization.
- Convex Analysis
- Convex analysis and global optimization
- Degeneracy in the multi-source Weber problem
- Exact and approximate solutions to the multisource weber problem
- Global solutions of the multi-source Weber problem
- Heuristic Methods for Location-Allocation Problems
- Location-Allocation Problems
- On the convergence of the Cooper's algorithm
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints
- Quadratic programming and affine variational inequalities. A qualitative study.
- Qualitative properties of the minimum sum-of-squares clustering problem
- Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum.
- Weiszfeld's method: old and new results
This page was built for publication: Local solutions of the multi-source Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982783)
