Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
From MaRDI portal
Publication:1026590
DOI10.1007/S10479-008-0351-0zbMath1163.90038OpenAlexW2000133896MaRDI QIDQ1026590
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0351-0
dominancedirected networkFermat-Weber problemquasimetricasymmetric distancenode optimalitysemidirected network
Related Items (20)
A generalized Weber problem with different gauges for different regions ⋮ Asymmetric distance location model ⋮ How bad can the centroid be? ⋮ Locally symmetrically connected T0-quasi-metric spaces ⋮ Principle component analysis: robust versions ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ Maximizing upgrading and downgrading margins for ordinal regression ⋮ Rejoinder on: ``Distance geometry and data science ⋮ Linear separation and approximation by minimizing the sum of concave functions of distances ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ Asymmetric empirical similarity ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions ⋮ Almost isometries of non-reversible metrics with applications to stationary spacetimes ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ Certain observations on antisymmetric \(T_0\)-quasi-metric spaces ⋮ Locating a median line with partial coverage distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A destination optimality in asymmetric distance Fermat-Weber problems
- Localization in single facility location
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Duality for constrained multifacility location problems with mixed norms and applications
- Geometrical properties of the Fermat-Weber problem
- Solving general continuous single facility location problems by cutting planes
- GBSSS: The generalized big square small square method for planar single- facility location
- Algorithms for computing centroids
- Weber problems with alternative transportation systems
- Restricted center problems under polyhedral gauges
- Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems
- Single facility location problems with unbounded unit balls
- A note on ``On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Locating a central hunter on the plane
- Location problems with different norms for different points
- 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
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
- The Chinese Postman Problem for Mixed Networks
- Finding Groups in Data
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- The Asymmetric Distance Location Problem
- On convex metrics
- An Extended Theorem for Location on a Network
- Convex Analysis
- An Approach to Location Models Involving Sets as Existing Facilities
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- On ordered algebras
- Geometry of cuts and metrics
This page was built for publication: Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
