The balanced 2-median and 2-maxian problems on a tree
From MaRDI portal
Publication:2687920
DOI10.1007/s10878-023-00997-9OpenAlexW2795355441MaRDI QIDQ2687920
Jafar Fathali, Mehdi Zaferanieh
Publication date: 7 March 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.10332
Related Items (2)
Cites Work
- The discrete facility location problem with balanced allocation of customers
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- Optimal location with equitable loads
- Equity measurement in facility location analysis: A review and framework
- 2-medians in trees with pos/neg weights
- The \(p\)-maxian problem on a tree
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Computing the 2‐median on tree networks in O(n lg n) time
- 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
- Efficient algorithms for finding <scp>2‐medians</scp> of a tree
This page was built for publication: The balanced 2-median and 2-maxian problems on a tree