The ripple-spreading algorithm for shortest path tour problems

DOI10.1016/J.TCS.2026.115962MaRDI QIDQ7240332zbMATH OpenFDO

Authors Yiming Ma, Xiao-Bing Hu, Hang Zhou, Ying-Fei Zhang, Daqing Li, Gong-Peng Zhang, Ezequiel Di Paolo, Mark S. Leeson

Publication date 11 May 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115962

zbMATH Keywords

\(k\) shortest pathsmany-to-many path optimizationoptimalityripple-spreading algorithmshortest path tour problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A generalized shortest path tour problem with time windows
• A note on two problems in connexion with graphs
• An efficient exact approach for the constrained shortest path tour problem
• An efficient time and space K point-to-point shortest simple paths algorithm
• Complexity analysis and optimization of the shortest path tour problem
• Constrained shortest path tour problem: branch-and-price algorithm
• Dynamic programming and optimal control. Vol. 2
• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
• Shortest path tour problem with time windows
• Shortest paths algorithms: Theory and experimental evaluation
• Solving the shortest path tour problem
• Some constrained shortest-route problems
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
• The constrained shortest path tour problem

This page was built for publication: The ripple-spreading algorithm for shortest path tour problems

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