A new algorithm for reoptimizing shortest paths when the arc costs change
From MaRDI portal
Publication:1413907
DOI10.1016/S0167-6377(02)00192-XzbMath1041.90062OpenAlexW2048815087MaRDI QIDQ1413907
Stefano Pallottino, Maria Grazia Scutellà
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00192-x
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Shortest path reoptimization vs resolution from scratch: a computational comparison, Incremental network design with shortest paths, Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price, Prioritized interdiction of nuclear smuggling via tabu search, A theory and algorithms for combinatorial reoptimization, Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization, An auction-based approach for the re-optimization shortest path tree problem, Shortest paths on dynamic graphs, A GRASP and path relinking heuristic for rural road network development
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A new algorithm to find the shortest paths between all pairs of nodes
- A generalized permanent label setting algorithm for the shortest path between specified nodes
- Reoptimization procedures in shortest path problem
- A note on the problem of updating shortest paths
- A dual simplex algorithm for finding all shortest paths
- Etude Et Extension D’Un Algorithme De Murghland
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- A new shortest path updating algorithm
- Dual algorithms for the shortest path tree problem
- Fibonacci heaps and their uses in improved network optimization algorithms
