Algebraic optimization: The Fermat-Weber location problem

DOI10.1007/BF01585739zbMath0692.90041MaRDI QIDQ584057

R. Chandrasekaran, Arie Tamir

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

location theorycharacteristic polynomialsapproximate solutionpolynomial methodFermat-Weber problemellipsoid methodalgebraic optimizationweighted sum of Euclidean distances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, On stars and Steiner stars, Fuzzy disk for covering fuzzy points, Heuristics and bounds for the travelling salesman location problem on the plane, Improved upper bounds for the Steiner ratio, The Fermat-Torricelli problem. I: A discrete gradient-method approach, The optimal solution set of the multi-source Weber problem, A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\), Approximating generalized distance functions on weighted triangulated surfaces with applications, Efficient subspace approximation algorithms, Matching point sets with respect to the earth mover's distance, One-dimensional \(k\)-center on uncertain data, New algorithms for facility location problems on the real line, Facility location problems with uncertainty on the plane, New models for locating a moving service facility, Geometric median and robust estimation in Banach spaces, Computing generalized higher-order Voronoi diagrams on triangulated surfaces, Unnamed Item, Stock cutting to minimize cutting length, The projection median of a set of points, Single facility collection depots location problem in the plane, Robust and Scalable Bayes via a Median of Subset Posterior Measures, On the Fermat-Weber center of a convex object, The Fermat-Torricelli point and isosceles tetrahedra, Fast approximations for sums of distances, clustering and the Fermat-Weber problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of elementary algebra and geometry
• The ellipsoid method and its consequences in combinatorial optimization
• Time bounds for selection
• A quadratically convergent method for minimizing a sum of euclidean norms
• Interactions Between Self and Parametrically Excited Motions in Articulated Tubes