A destination optimality in asymmetric distance Fermat-Weber problems
From MaRDI portal
Publication:689258
DOI10.1007/BF02060487zbMath0783.90061MaRDI QIDQ689258
Publication date: 20 December 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (24)
Asymmetric distance location model ⋮ How bad can the centroid be? ⋮ A discretizing algorithm for location problems ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Improved fixed point optimality conditions for mixed norms minisum location ⋮ Asymmetric empirical similarity ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Minsum location extended to gauges and to convex sets ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ Locating a central hunter on the plane ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ Multicriteria decision making under uncertainty: a visual approach ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ Undesirable facility location with minimal covering objectives ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ Some personal views on the current state and the future of locational analysis ⋮ General models in min-max continuous location: Theory and solution techniques ⋮ General models in min-max planar location: Checking optimality conditions ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ Comments on: ``Distance geometry and data science ⋮ Locating a median line with partial coverage distance
Cites Work
- Geometrical properties of the Fermat-Weber problem
- An improved method for the solution of the problem of location on an inclined plane
- Using Block Norms for Location Modeling
- The P-Centroid Problem on an Inclined Plane
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- The Asymmetric Distance Location Problem
- On convex metrics
- Convex Analysis
- Modelling Inter-city Road Distances by Mathematical Functions
This page was built for publication: A destination optimality in asymmetric distance Fermat-Weber problems
