Solving the absolute 1-center problem in the quickest path case
From MaRDI portal
Publication:2119314
DOI10.1007/S41980-021-00536-4zbMath1484.90093OpenAlexW3156782711MaRDI QIDQ2119314
Iman Keshtkar, Mehdi Ghiyasvand
Publication date: 29 March 2022
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-021-00536-4
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inverse eccentric vertex problem on networks
- Algorithms for the quickest path problem and the reliable quickest path problem
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Some new algorithms for location problems on networks
- An algorithm for the quickest path problem
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Inverse quickest center location problem on a tree
- A label-setting algorithm for finding a quickest path
- Inverse group 1-median problem on trees
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Reverse 1-center problem on weighted trees
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- The Rectilinear Steiner Tree Problem is $NP$-Complete
This page was built for publication: Solving the absolute 1-center problem in the quickest path case
