A two-phase shortest path algorithm for networks with node coordinates

DOI10.1016/0377-2217(94)00152-3zbMath0914.90256OpenAlexW1987600610MaRDI QIDQ1390292

Jens Lysgaard

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00152-3

zbMATH Keywords

upper boundshortest pathheuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Heuristic shortest path algorithms for transportation applications: state of the art

Cites Work

• A note on two problems in connexion with graphs

This page was built for publication: A two-phase shortest path algorithm for networks with node coordinates