Shortest path reoptimization vs resolution from scratch: a computational comparison

DOI10.1080/10556788.2021.1895153OpenAlexW3135355563MaRDI QIDQ5043855

Serena Fugaro, Paola Festa, Francesca Guerriero

Publication date: 6 October 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2021.1895153

zbMATH Keywords

shortest pathcomputational comparisondual approachreoptimization

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Uses Software

• Algorithm 360

Cites Work

• A note on two problems in connexion with graphs
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Shortest path auction algorithm without contractions using virtual source concept
• Shortest paths algorithms: Theory and experimental evaluation
• An auction-based approach for the re-optimization shortest path tree problem
• Speeding Up Dynamic Shortest-Path Algorithms
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Reoptimization procedures in shortest path problem
• A dual simplex algorithm for finding all shortest paths
• An Auction Algorithm for Shortest Paths
• Buckets, Heaps, Lists, and Monotone Priority Queues
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Shortest Path Tree Computation in Dynamic Graphs
• Graph collapsing in shortest path auction algorithms
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item