Geometrical properties of the Fermat-Weber problem

DOI10.1016/0377-2217(85)90006-2zbMath0564.90013OpenAlexW2019218765MaRDI QIDQ1058438

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90006-2

zbMATH Keywords

convex hull facility location Fermat-Weber problem metric hull mixed gauges nonsymmetric distances octagonal hull

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

Asymmetric distance location model ⋮ Sets of efficient points in a normed space ⋮ A geometric characterisation of the quadratic min-power centre ⋮ Minkowski Geometry—Some Concepts and Recent Developments ⋮ Unnamed Item ⋮ Localization in multifacility location theory ⋮ Minmax regret location--allocation problem on a network under uncertainty ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ The Fermat-Torricelli problem. I: A discrete gradient-method approach ⋮ Convex hull properties in location theory ⋮ The Fermat-Torricelli theorem in convex geometry ⋮ A discretizing algorithm for location problems ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Weber problems with high-speed lines ⋮ Unnamed Item ⋮ Dominating sets for convex functions with some applications ⋮ Duality results for nonlinear single minimax location problems via multi-composed optimization ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Obnoxious facility location in multiple dimensional space ⋮ Hamilton-Jacobi scaling limits of Pareto peeling in 2D ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ A primal-dual algorithm for the fermat-weber problem involving mixed gauges ⋮ Geometry where direction matters -- or does it? ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ ∊-Variational inequalities in partially ordered spaces ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Minsum location extended to gauges and to convex sets ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization ⋮ Facility location in normed linear spaces ⋮ Group nearest-neighbor queries in the \(L_1\) plane ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ Optimal locations and inner products ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ A destination optimality in asymmetric distance Fermat-Weber problems ⋮ The 1-median and 1-highway problem ⋮ Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538] ⋮ Extensions to the continuous ordered median problem ⋮ On the structure of the solution set for the single facility location problem with average distances ⋮ Multicriteria decision making under uncertainty: a visual approach ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Balancing unit vectors ⋮ Simultaneous location of a service facility and a rapid transit line ⋮ Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem ⋮ The local Steiner problem in normed planes ⋮ Minsum hyperspheres in normed spaces ⋮ Gauge distances and median hyperplanes ⋮ εVariational inequalities for vector approximation problems ⋮ El conjunto eficiente en problemas de localizacion con normas mixtas (L p) ⋮ Error bounds for the approximative solution of restricted planar location problems ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ The Fermat--Torricelli problem in normed planes and spaces ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ Approximation of solutions for location problems ⋮ Weber problems with alternative transportation systems ⋮ Locating a general minisum `circle' on the plane ⋮ Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints ⋮ A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem ⋮ On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane ⋮ Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms ⋮ Semi-obnoxious location models: A global optimization approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ Efficiency in constrained continuous location ⋮ Restricted center problems under polyhedral gauges ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Location problems with different norms for different points ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ Duality for optimal control-approximation problems with gauges ⋮ Multicriteria planar ordered median problems ⋮ The \(K\)-connection location problem in a plane

Cites Work