A note on Fermat's problem
From MaRDI portal
Recommendations
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- The Fermat-Weber location problem revisited
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- Local convergence in a generalized Fermat-Weber problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
Cites work
Cited in
(only showing first 100 items - show all)- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Probabilistic d-clustering
- The Fermat-Weber location problem revisited
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- Heuristics for location models
- Surface fitting and registration of point clouds using approximations of the unsigned distance function
- A majorization-minimization algorithm for computing the Karcher mean of positive definite matrices
- Fixed gate point location problems
- The optimal solution set of the multi-source Weber problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Multifacility minimax location problems via multi-composed optimization
- On the robust PCA and Weiszfeld's algorithm
- Medians and means in Finsler geometry
- εVariational inequalities for vector approximation problems
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Local convergence in Fermat's problem
- On the Fermat—Weber problem with convex cost functions
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- Open and closed random walks with fixed edgelengths in \(\mathbf{\mathbb{R}^d}\)
- Locating the vertices of a steiner tree in an arbitrary metric space
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D
- Optimization of location of interconnected facilities on parallel lines with forbidden zones
- Duality in constrained location problems
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- Local solutions of the multi-source Weber problem
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
- Correspondence analysis with least absolute residuals
- A generalized Weiszfeld method for the multi-facility location problem
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- Bearing-only solution for Fermat-Weber location problem: generalized algorithms
- Accelerating the convergence in the single-source and multi-source Weber problems
- \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint
- A note on an Olympiad problem
- An improved extra-gradient method for minimizing a sum of p-norms -- a variational inequality approach
- Duality results for nonlinear single minimax location problems via multi-composed optimization
- Main directions in the development of informatics
- ∊-Variational inequalities in partially ordered spaces
- A projection method for \(l_ p\) norm location-allocation problems
- On the location of the minimum point in the Euclidean distance sum problem
- Detecting influential observations in kernel PCA
- Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993
- Weber's problem and weiszfeld's algorithm in general spaces
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Local convergence in a generalized Fermat-Weber problem
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- Solving general continuous single facility location problems by cutting planes
- Heuristics and bounds for the travelling salesman location problem on the plane
- An approach to formalization and analysis of group choice problems
- PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
- Voting with rubber bands, weights, and strings
- Uniqueness and nonuniqueness for the \(L^1\) minimization source localization problem with three measurements
- scientific article; zbMATH DE number 3141370 (Why is no real title available?)
- Optimal location on a sphere
- On duality in the vectorial control-approximation problem
- An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- Minimizing differences of convex functions with applications to facility location and clustering
- Time-dependent green Weber problem
- Duality in constrained multi‐facility location models
- Clustering and the perturbed spatial median
- Contour approximation of data: a duality theory
- A globally convergent algorithm for facility location on a sphere
- A quadratically convergent method for minimizing a sum of euclidean norms
- Solution of location problems with radial cost functions
- The generalized Fermat-Torricelli problem in Hilbert spaces
- A note on the Fermat equation
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- The Fermat-Weber location problem in single integrator dynamics using only local bearing angles
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Weiszfeld's method: old and new results
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- On an open problem in spherical facility location
- A historical perspective on location problems
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Sparse group fused Lasso for model segmentation: a hybrid approach
- Location analysis: a synthesis and survey
- Facility location problems with uncertainty on the plane
- Local convexity results in a generalized Fermat-Weber problem
- A spatial-type interval-valued median for random intervals
- Asymptotic behavior of the Weber location problem on the plane
- On implementation of a self-dual embedding method for convex programming
- On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces
- On the point for which the sum of the distances to n given points is minimum
- Semi-obnoxious single facility location in Euclidean space.
- Locational analysis
- The impact of distance on location problems
- Optimal location of a single facility with circular demand areas
- On an extension of Weber problem with Euclidean distance
- Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: L^p and almost sure rates of convergence
- Location problems with costs being sums of powers of Euclidean distances
- Continuous location of an assembly station
- A characterization of the Fermat point in Hilbert spaces
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- On vector and matrix median computation
- An efficient algorithm for facility location in the presence of forbidden regions
- Capacitated location-allocation problems on a line
- A fast algorithm for the rectilinear distance location problem
- The Fermat-Torricelli problem revisited
This page was built for publication: A note on Fermat's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5670473)