A lower bound for the quickest path problem

DOI10.1016/j.cor.2014.04.015zbMath1348.90594OpenAlexW2094625827MaRDI QIDQ337093

Gianpaolo Ghiani, Emanuela Guerriero

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.04.015

zbMATH Keywords

Dijkstra's algorithm\(\mathrm{A}^\ast\) algorithmquickest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Time-dependent routing problems: a review ⋮ Determining time-dependent minimum cost paths under several objectives

Uses Software

• Graphs
• OpenStreetMap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Engineering Route Planning Algorithms
• Shortest-path queries in static networks

This page was built for publication: A lower bound for the quickest path problem