A finite algorithm for the continuousp-center location problem on a graph
From MaRDI portal
Recommendations
- On the Solution Value of the Continuous p-Center Location Problem on a Graph
- A heuristic for the p-center problem in graphs
- Un nuevo resultado sobre la complejidad del problema delP-centro
- An improved algorithm for the p-center problem on interval graphs with unit lengths
- The continuous center set of a network
Cites work
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Efficient search for rationals
- Finding kth paths and p-centers by generating and searching good data structures
- Khachiyan’s algorithm for linear programming
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- New Results on the Complexity of p-Centre Problems
- Rational search
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- The continuousm-center problem on a network
Cited in
(4)
This page was built for publication: A finite algorithm for the continuousp-center location problem on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724065)
