The following pages link to A note on Fermat's problem (Q5670473):
Displaying 50 items.
- Geometric median and robust estimation in Banach spaces (Q122792) (← links)
- Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence (Q268758) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- A characterization of the Fermat point in Hilbert spaces (Q358260) (← links)
- A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Voting with rubber bands, weights, and strings (Q449038) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Correspondence analysis with least absolute residuals (Q578805) (← links)
- Solution of location problems with radial cost functions (Q584914) (← links)
- Clustering and the perturbed spatial median (Q611736) (← links)
- Surface fitting and registration of point clouds using approximations of the unsigned distance function (Q631004) (← links)
- Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
- Asymptotic behavior of the Weber location problem on the plane (Q689239) (← links)
- On the location of the minimum point in the Euclidean distance sum problem (Q723341) (← links)
- Probabilistic d-clustering (Q734358) (← links)
- A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity (Q811227) (← links)
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach (Q853553) (← links)
- The Fermat-Weber location problem in single integrator dynamics using only local bearing angles (Q894337) (← links)
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges (Q918867) (← links)
- Finite-to-one maps (Q952586) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem (Q980366) (← links)
- Contour approximation of data: a duality theory (Q1017637) (← links)
- On the point for which the sum of the distances to \(n\) given points is minimum (Q1026585) (← links)
- Location problems with costs being sums of powers of Euclidean distances (Q1086127) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- Heuristics and bounds for the travelling salesman location problem on the plane (Q1099066) (← links)
- Duality in constrained location problems (Q1102171) (← links)
- The impact of distance on location problems (Q1142684) (← links)
- Optimal location on a sphere (Q1148106) (← links)
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle (Q1148209) (← links)
- Locational analysis (Q1173002) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- A globally convergent algorithm for the Euclidean multiplicity location problem (Q1210269) (← links)
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria (Q1236403) (← links)
- Normative location theory: Placement in continuous space (Q1237028) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- A globally convergent algorithm for facility location on a sphere (Q1323619) (← links)
- A projection method for \(l_ p\) norm location-allocation problems (Q1337136) (← links)
- Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
- The convergence of the Weiszfeld algorithm (Q1586265) (← links)
- A note on convergence in the single facility minisum location problem (Q1608453) (← links)
- A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
- Time-dependent green Weber problem (Q1651568) (← links)
- Duality results for nonlinear single minimax location problems via multi-composed optimization (Q1683947) (← links)
- A heuristic method for large-scale multi-facility location problems (Q1765537) (← links)