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

DOI10.1002/NET.3230150308zbMath0579.90024OpenAlexW2049433145MaRDI 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 locationweighted treep-center

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (18)

Efficient algorithms for center problems in cactus networks ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ Double bound method for solving the \(p\)-center location problem ⋮ INDUCTIVE ALGORITHMS ON FINITE TREES ⋮ The extensive 1-median problem with radius on networks ⋮ Exact solution approaches for the discrete α‐neighbor p‐center 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 ⋮ The stratified \(p\)-center problem ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Dominant, an algorithm for the \(p\)-center problem. ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ The weighted \(k\)-center problem in trees for fixed \(k\) ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ Discrete Center Problems ⋮ An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees

This page was built for publication: Algorithms for finding P-centers on a weighted tree (for relatively small P)