Minimizing the expense transmission time from the source node to demand nodes
From MaRDI portal
Recommendations
Cites work
- A new approach to all-pairs shortest paths on real-weighted graphs
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Efficient algorithms for the round-trip 1-center and 1-median problems
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Inverse eccentric vertex problem on networks
- Inverse group 1-median problem on trees
- Inverse quickest center location problem on a tree
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Local search heuristic for k-median and facility location problems
- Location-routing: issues, models and methods
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- On the quickest path problem
- One-way and round-trip center location problems
- Reverse 1-center problem on weighted trees
- Single facility collection depots location problem in the plane
- The quickest path problem
This page was built for publication: Minimizing the expense transmission time from the source node to demand nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497033)
