A lower bound for the quickest path problem

DOI10.1016/J.COR.2014.04.015zbMATH Open1348.90594OpenAlexW2094625827MaRDI QIDQ337093FDOQ337093

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)

Cites Work

• Title not available (Why is that?)
• Shortest-path queries in static networks
• A note on two problems in connexion with graphs
• Engineering Route Planning Algorithms
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Title not available (Why is that?)

Cited In (4)

• Determining time-dependent minimum cost paths under several objectives
• The quickest path problem
• The quickest path problem with batch constraints.
• Time-dependent routing problems: a review

Uses Software

• Graphs
• OpenStreetMap

   Recommendations

• A lower bound for the shortest path problem 👍 👎
• Title not available (Why is that?) 👍 👎
• The time-dependent quickest path problem: Properties and bounds 👍 👎
• On the quickest path problem 👍 👎
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths 👍 👎
• An algorithm for the quickest path problem 👍 👎
• Algorithms for the quickest path problem and the enumeration of quickest paths 👍 👎
• Lower and upper bounds of shortest paths in reachability graphs 👍 👎
• The quickest path problem 👍 👎
• Algorithms for the quickest path problem and the reliable quickest path problem 👍 👎

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

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