Collection depots facility location problems in trees
From MaRDI portal
Recommendations
Cites work
- A generalized algorithm for centrality problems on trees
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Minisum collection depots location problem with multiple facilities on a network
- On the collection depots location problem
- One-way and round-trip center location problems
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- The collection depots location problem on networks
- Unbounded Searching Algorithms
Cited in
(9)- 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
- Efficient algorithms for the round-trip 1-center and 1-median problems
- On the round-trip 1-center and 1-median problems
- Simultaneous embeddings of graphs as median and antimedian subgraphs
- When centers can fail: a close second opportunity
- The collection depots location problem on networks
- Minisum collection depots location problem with multiple facilities on a network
This page was built for publication: Collection depots facility location problems in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191128)