Geometrical properties of the Fermat-Weber problem

DOI10.1016/0377-2217(85)90006-2zbMATH Open0564.90013OpenAlexW2019218765MaRDI QIDQ1058438FDOQ1058438

Authors: Roland Durier, Christian Michelot 

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

Recommendations

• scientific article; zbMATH DE number 1803754
• On the Set of Optimal Points to the Weber Problem: Further Results
• scientific article; zbMATH DE number 3984918
• On the Set of Optimal Points to the Weber Problem
• Noniterative solution of some Fermat-Weber location problems

zbMATH Keywords

convex hullfacility locationFermat-Weber problemmetric hullmixed gaugesnonsymmetric distancesoctagonal hull

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• Title not available (Why is that?)
• On Efficient Solutions to Multiple Objective Mathematical Programs
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• Location Theory, Dominance, and Convexity
• Hull properties in location problems
• Some Properties of Location Problems with Block and Round Norms
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Title not available (Why is that?)
• Points minimaux et ensembles optimaux dans les espaces de Banach
• Convex Sets and Nearest Points. II

Cited In (79)

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

This page was built for publication: Geometrical properties of the Fermat-Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058438)