Shortest path reoptimization vs resolution from scratch: a computational comparison

DOI10.1080/10556788.2021.1895153MaRDI QIDQ5043855zbMATH OpenOpenAlexFDO

Authors Serena Fugaro, Paola Festa, Francesca Guerriero

Publication date 6 October 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

computational comparisondual approachreoptimizationshortest path

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 938615
• scientific article; zbMATH DE number 2096648
• The shortest-path problem. Analysis and comparison of methods
• A new algorithm for reoptimizing shortest paths when the arc costs change
• The complexity of rerouting shortest paths
• The complexity of rerouting shortest paths
• Shortest path methods: A unifying approach
• Shortest‐path methods: Complexity, interrelations and new propositions
• Shortest-path feasibility algorithms, an experimental evaluation
• Shortest path feasibility algorithms: an experimental evaluation

Cites work

• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A dual simplex algorithm for finding all shortest paths
• A new algorithm for reoptimizing shortest paths when the arc costs change
• A note on two problems in connexion with graphs
• An Auction Algorithm for Shortest Paths
• An auction-based approach for the re-optimization shortest path tree problem
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Benchmarking optimization software with performance profiles.
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Graph collapsing in shortest path auction algorithms
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 1086916 (Why is no real title available?)
• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• Reoptimization procedures in shortest path problem
• Shortest path auction algorithm without contractions using virtual source concept
• Shortest Path Tree Computation in Dynamic Graphs
• Shortest paths algorithms: Theory and experimental evaluation
• Speeding up dynamic shortest-path algorithms

Cited in

(3)

• A new algorithm for reoptimizing shortest paths when the arc costs change
• scientific article; zbMATH DE number 2096648 (Why is no real title available?)
• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

Describes a project that uses

Uses Software

• Algorithm 360

This page was built for publication: Shortest path reoptimization vs resolution from scratch: a computational comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043855)