Collection depots facility location problems in trees
From MaRDI portal
Publication:5191128
DOI10.1002/net.20258zbMath1168.90534MaRDI QIDQ5191128
Binay K. Bhattacharya, Robert Benkoczi, Arie Tamir
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20258
90C35: Programming involving graphs or networks
05C05: Trees
90B80: Discrete location and assignment
Related Items
Efficient algorithms for the round-trip 1-center and 1-median problems, When centers can fail: a close second opportunity, Single facility collection depots location problem in the plane, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Extensive facility location problems on networks: an updated review, Simultaneous embeddings of graphs as median and antimedian subgraphs
Cites Work
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- One-way and round-trip center location problems
- Unbounded Searching Algorithms
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A generalized algorithm for centrality problems on trees
- The collection depots location problem on networks
- Minisum collection depots location problem with multiple facilities on a network
- On the collection depots location problem