On finding minimum routes in a network with turn penalties
From MaRDI portal
Publication:5725184
DOI10.1145/366105.366184zbMath0116.12302OpenAlexW2060484689WikidataQ128379032 ScholiaQ128379032MaRDI QIDQ5725184
Publication date: 1961
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/366105.366184
Related Items (8)
On the analysis of optimization problems in arc-dependent networks ⋮ Trajectory planning for unmanned aerial vehicles: a network optimization approach ⋮ On the approximability of path and cycle problems in arc-dependent networks ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks ⋮ Route planning with turn restrictions: A computational experiment ⋮ Solution of real-world postman problems ⋮ Path optimization for the resource-constrained searcher ⋮ Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
This page was built for publication: On finding minimum routes in a network with turn penalties
