Algorithms for shortest path tour problem

DOI10.1016/J.TCS.2025.115428MaRDI QIDQ6914031zbMATH OpenFDO

Authors Yucen Gao, Zhuoran Li, Jingyu He, Jun Fang, Hui Gao, Xiaofeng Gao, Guihai Chen

Publication date 17 October 2025

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

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

zbMATH Keywords

carpooling route planningglobal Dijkstra algorithmlarge-scale road networkshortest path tour problemstage Dijkstra algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Programming involving graphs or networks (90C35)

Cites work

• A note on two problems in connexion with graphs
• Algorithms for shortest path tour problem in large-scale road network
• Complexity analysis and optimization of the shortest path tour problem
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 7788484 (Why is no real title available?)
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving the shortest path tour problem
• Some constrained shortest-route problems

This page was built for publication: Algorithms for shortest path tour problem

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