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

Eliécer GutiérrezAndrés L. Medaglia2026-03-222026-03-22200710.1007/s10479-007-0198-9https://doi.org/10.1007/s10479-007-0198-9https://andeanlibrary.org/handle/123456789/44629Citaciones: 51enShortest path problemComputer scienceDijkstra's algorithmTheory of computationShortest Path Faster AlgorithmDual (grammatical number)GraphAlgorithmCore (optical fiber)Scale (ratio)Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networksarticle