Multi-facility ordered median problems in directed networks
From MaRDI portal
Publication:545449
DOI10.1007/s11424-011-9327-2zbMath1219.90090OpenAlexW2068717642MaRDI QIDQ545449
Publication date: 22 June 2011
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-011-9327-2
Related Items (2)
A note on the subtree ordered median problem in networks based on nestedness property ⋮ A note on the nestedness property for ordered median problems in tree networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic results for ordered median problems
- A constant-factor approximation algorithm for the \(k\)-median problem
- The \(p\)-facility ordered median problem on networks
- Algorithms for Reporting and Counting Geometric Intersections
- Location Theory
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- Finite Dominating Sets for Network Location Problems
- Dynamic facility location: The progressive p-median problem
- Multifacility ordered median problems on networks: A further analysis
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Multi-facility ordered median problems in directed networks