A finite algorithm for the continuousp-center location problem on a graph
From MaRDI portal
Publication:3724065
DOI10.1007/BF02591951zbMath0593.90027MaRDI QIDQ3724065
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Cites Work
- Rational search
- Efficient search for rationals
- New Results on the Complexity of p-Centre Problems
- The continuousm-center problem on a network
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Khachiyan’s algorithm for linear programming
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Finding kth paths and p-centers by generating and searching good data structures