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