Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Shortest path calculation in large road networks

From MaRDI portal
Publication:1384218
Jump to:navigation, search

DOI10.1007/BF01545524zbMath0897.90092OpenAlexW2072208720MaRDI QIDQ1384218

Gerhard Ertl

Publication date: 13 April 1998

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545524


zbMATH Keywords

shortest pathpreprocessing algorithmtransportation planningroad network


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06)


Related Items (3)

A parallel bio-inspired shortest path algorithm ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks



Cites Work

  • Unnamed Item
  • Unnamed Item


This page was built for publication: Shortest path calculation in large road networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1384218&oldid=13536879"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki