Algebraic optimization: The Fermat-Weber location problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3401212 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A quadratically convergent method for minimizing a sum of euclidean norms
- Interactions Between Self and Parametrically Excited Motions in Articulated Tubes
- The complexity of elementary algebra and geometry
- The ellipsoid method and its consequences in combinatorial optimization
- Time bounds for selection
Cited in
(32)- New models for locating a moving service facility
- On the Fermat-Weber point of a polygonal chain and its generalizations
- Stock cutting to minimize cutting length
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Single facility collection depots location problem in the plane
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- Heuristics and bounds for the travelling salesman location problem on the plane
- The Fermat-Torricelli problem. I: A discrete gradient-method approach
- Data loci in algebraic optimization
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Improved upper bounds for the Steiner ratio
- Facility location problems with uncertainty on the plane
- Matching point sets with respect to the earth mover's distance
- The projection median of a set of points
- Approximating the distribution of the median and other robust estimators on uncertain data
- Fuzzy disk for covering fuzzy points
- A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
- On the Fermat-Weber center of a convex object
- Location problems with costs being sums of powers of Euclidean distances
- Accelerating convergence in the Fermat-Weber location problem
- The Fermat-Torricelli point and isosceles tetrahedra
- One-dimensional \(k\)-center on uncertain data
- Geometric median and robust estimation in Banach spaces
- Efficient subspace approximation algorithms
- The Fermat-Weber location problem revisited
- New algorithms for facility location problems on the real line
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- Robust and scalable Bayes via a median of subset posterior measures
- On stars and Steiner stars
- The optimal solution set of the multi-source Weber problem
This page was built for publication: Algebraic optimization: The Fermat-Weber location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584057)
