A lower bound for the quickest path problem

DOI10.1016/J.COR.2014.04.015MaRDI QIDQ337093zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A lower bound for the shortest path problem
• An efficient lower-bounding approach to point-to-point shortest path problem
• 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

Cites work

• scientific article; zbMATH DE number 3415384 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Engineering Route Planning Algorithms
• Network flows. Theory, algorithms, and applications.
• Shortest-path queries in static networks

Cited in

(6)

• 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
• The time-dependent quickest path problem: properties and bounds
• An efficient lower-bounding approach to point-to-point shortest path problem

Describes a project that uses

Uses Software

• OpenStreetMap
• Graphs

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)