An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem

DOI10.1007/978-3-642-24983-9_16zbMath1349.68297OpenAlexW1485025535MaRDI QIDQ3098082

Hiroshi Nagamochi, Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao

Publication date: 11 November 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24983-9_16

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A fishing route optimization decision support system: the case of the tuna purse seiner ⋮ Convergecast Tree on Temporal Graphs

This page was built for publication: An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem