Upgrading arcs to minimize the maximum travel time in a network
From MaRDI portal
Publication:5469125
DOI10.1002/net.20097zbMath1129.90056OpenAlexW4239338814MaRDI QIDQ5469125
Li Zhang, Ann Melissa Campbell, Timothy J. Lowe
Publication date: 16 May 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20097
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Case-oriented studies in operations research (90B90) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Optimizing budget allocation for center and median points ⋮ Robust flows with losses and improvability in evacuation planning ⋮ General network design: a unified view of combined location and network design problems ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ A GRASP metaheuristic to improve accessibility after a disaster
Cites Work
This page was built for publication: Upgrading arcs to minimize the maximum travel time in a network
