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

UniALT for regular language contrained shortest paths on a multi-modal transportation network

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

DOI10.4230/OASIcs.ATMOS.2011.64zbMath1247.90052OpenAlexW2147095480MaRDI QIDQ2917259

Dominik Kirchler, Roberto Wolfler Calvo, Leo Liberti, Thomas Pajor

Publication date: 28 September 2012

Full work available at URL: https://i11www.iti.uni-karlsruhe.de/extra/publications/klpc-ualt-11.pdf


zbMATH Keywords

shortest pathregular languagetime-dependencymulti-modalALT


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)


Related Items (2)

Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks ⋮ User-Constrained Multimodal Route Planning




This page was built for publication: UniALT for regular language contrained shortest paths on a multi-modal transportation network

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