Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

Simple item page
dc.contributor.authorEliécer Gutiérrez
dc.contributor.authorAndrés L. Medaglia
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T14:06:57Z
dc.date.available2026-03-22T14:06:57Z
dc.date.issued2007
dc.descriptionCitaciones: 51
dc.identifier.doi10.1007/s10479-007-0198-9
dc.identifier.urihttps://doi.org/10.1007/s10479-007-0198-9
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/44629
dc.language.isoen
dc.publisherSpringer Science+Business Media
dc.relation.ispartofAnnals of Operations Research
dc.sourceUniversidad de Los Andes
dc.subjectShortest path problem
dc.subjectComputer science
dc.subjectDijkstra's algorithm
dc.subjectTheory of computation
dc.subjectShortest Path Faster Algorithm
dc.subjectDual (grammatical number)
dc.subjectGraph
dc.subjectAlgorithm
dc.subjectCore (optical fiber)
dc.subjectScale (ratio)
dc.titleLabeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
dc.typearticle

Files

Collections

Artículo Científico Publicado