A note on Fermat's problem
From MaRDI portal
Publication:5670473
DOI10.1007/BF01584648zbMath0255.90063WikidataQ62065787 ScholiaQ62065787MaRDI QIDQ5670473
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces, Hamilton-Jacobi scaling limits of Pareto peeling in 2D, Capacitated location-allocation problems on a line, Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence, LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, A fast algorithm for the rectilinear distance location problem, Location problems with costs being sums of powers of Euclidean distances, Solving general continuous single facility location problems by cutting planes, A projection method for \(l_ p\) norm location-allocation problems, On duality in the vectorial control-approximation problem, On an open problem in spherical facility location, Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993, On an extension of Weber problem with Euclidean distance, Heuristics and bounds for the travelling salesman location problem on the plane, An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets, Duality in constrained location problems, Duality in constrained multi‐facility location models, An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach, Accelerating convergence in minisum location problem with \(\ell p\) norms, Time-dependent green Weber problem, An approach to formalization and analysis of group choice problems, Continuous location of an assembly station, A characterization of the Fermat point in Hilbert spaces, A spatial-type interval-valued median for random intervals, Minimizing differences of convex functions with applications to facility location and clustering, The Fermat-Weber location problem revisited, Clustering and the perturbed spatial median, Unnamed Item, The optimal solution set of the multi-source Weber problem, A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices, Duality results for nonlinear single minimax location problems via multi-composed optimization, Optimization of location of interconnected facilities on parallel lines with forbidden zones, The generalized Fermat-Torricelli problem in Hilbert spaces, The Fermat-Weber location problem in single integrator dynamics using only local bearing angles, The impact of distance on location problems, On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\), Optimal location on a sphere, 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, Local convergence in Fermat's problem, Surface fitting and registration of point clouds using approximations of the unsigned distance function, A projected Weiszfeld algorithm for the box-constrained Weber location problem, Accelerating the convergence in the single-source and multi-source Weber problems, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, A primal-dual algorithm for the fermat-weber problem involving mixed gauges, Voting with rubber bands, weights, and strings, On Pareto optima, the Fermat-Weber problem, and polyhedral gauges, Semi-obnoxious single facility location in Euclidean space., Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, Detecting influential observations in kernel PCA, Locational analysis, PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE, Locating the vertices of a steiner tree in an arbitrary metric space, ∊-Variational inequalities in partially ordered spaces, Fixed gate point location problems, How to find Steiner minimal trees in Euclidean \(d\)-space, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach, \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint, Finite-to-one maps, Uniqueness and nonuniqueness for the \(L^1\) minimization source localization problem with three measurements, UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS, A quadratically convergent method for minimizing a sum of euclidean norms, Local convergence in a generalized Fermat-Weber problem, Asymptotic behavior of the Weber location problem on the plane, Medians and means in Finsler geometry, A globally convergent algorithm for the Euclidean multiplicity location problem, A heuristic method for large-scale multi-facility location problems, Weiszfeld's method: old and new results, A generalized Weiszfeld method for the multi-facility location problem, A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem, On the robust PCA and Weiszfeld's algorithm, Location analysis: a synthesis and survey, Optimal location of a single facility with circular demand areas, εVariational inequalities for vector approximation problems, Facility location problems with uncertainty on the plane, On the Fermat—Weber problem with convex cost functions, Correspondence analysis with least absolute residuals, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Normative location theory: Placement in continuous space, Solution of location problems with radial cost functions, On the location of the minimum point in the Euclidean distance sum problem, Weber's problem and weiszfeld's algorithm in general spaces, Geometric median and robust estimation in Banach spaces, PARETO ENVELOPES IN SIMPLE POLYGONS, Probabilistic d-clustering, On implementation of a self-dual embedding method for convex programming, Local convexity results in a generalized Fermat-Weber problem, Sparse group fused Lasso for model segmentation: a hybrid approach, Contour approximation of data: a duality theory, An efficient algorithm for facility location in the presence of forbidden regions, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, A historical perspective on location problems, Main directions in the development of informatics, Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem, Open and closed random walks with fixed edgelengths in $ \newcommand{\m}{\mathcal} \newcommand{\R}{\mathbb{R}} \R^d$, Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets, The convergence of the Weiszfeld algorithm, Heuristics for Location Models, The Weiszfeld Algorithm: Proof, Amendments, and Extensions, A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity, A note on convergence in the single facility minisum location problem, A globally convergent algorithm for facility location on a sphere
Cites Work
