Algorithms for finding P-centers on a weighted tree (for relatively small P)

DOI10.1002/net.3230150308zbMath0579.90024MaRDI QIDQ3703611

No author found.

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230150308

zbMATH Keywords

facility location; weighted tree; p-center

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C90: Applications of mathematical programming

90B05: Inventory, storage, reservoirs

Related Items

Unnamed Item, The backup 2‐center and backup 2‐median problems on trees, Discrete Center Problems, An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees, Double bound method for solving the \(p\)-center location problem, Backup 2-center on interval graphs, Efficient algorithms for the one-dimensional \(k\)-center problem, The 2-radius and 2-radiian problems on trees, Optimal algorithms for the path/tree-shaped facility location problems in trees, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Dominant, an algorithm for the \(p\)-center problem., The stratified \(p\)-center problem, The weighted \(k\)-center problem in trees for fixed \(k\), Efficient algorithms for center problems in cactus networks, Improved algorithms for some competitive location centroid problems on paths, trees and graphs, INDUCTIVE ALGORITHMS ON FINITE TREES