An auction-based approach for the re-optimization shortest path tree problem

DOI10.1007/S10589-019-00132-7MaRDI QIDQ2282822zbMATH OpenOpenAlexWikidataFDO

Authors Paola Festa, Francesca Guerriero, Antonio Napoletano

Publication date 19 December 2019

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-019-00132-7

zbMATH Keywords

auction approachnetworksre-optimizationshortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2096648
• A new algorithm for reoptimizing shortest paths when the arc costs change
• LP formulations of the shortest path tree problem
• A reoptimization algorithm for the shortest path problem with time windows
• Dual algorithms for the shortest path tree problem

Cites work

• A computational study of solution approaches for the resource constrained elementary shortest path problem
• A Dual Shortest Path Algorithm
• A dual simplex algorithm for finding all shortest paths
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• A new algorithm for reoptimizing shortest paths when the arc costs change
• A new algorithm to find the shortest paths between all pairs of nodes
• A note on two problems in connexion with graphs
• A survey of resource constrained shortest path problems: exact solution approaches
• An Auction Algorithm for Shortest Paths
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Dual algorithms for the shortest path tree problem
• Dynamically maintaining shortest path trees under batches of updates
• Fast paths in large-scale dynamic road networks
• scientific article; zbMATH DE number 5610761 (Why is no real title available?)
• 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 1488066 (Why is no real title available?)
• scientific article; zbMATH DE number 2096648 (Why is no real title available?)
• Lifelong planning \(\text{A}^*\)
• Network flows. Theory, algorithms, and applications.
• Parallel asynchronous label-correcting methods for shortest paths
• Polynomial auction algorithms for shortest paths
• 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
• The auction technique for the sensor based navigation planning of an autonomous mobile robot
• The constrained shortest path tour problem
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Vehicle Routing

Cited in

(3)

• A reoptimization algorithm for the shortest path problem with time windows
• LP formulations of the shortest path tree problem
• Shortest path reoptimization vs resolution from scratch: a computational comparison

Describes a project that uses

Uses Software

• DIMACS
• VRP
• RelaxIV

This page was built for publication: An auction-based approach for the re-optimization shortest path tree problem

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