Route planning with turn restrictions: A computational experiment (Q1758274): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An efficient algorithm for computing least cost paths with turn constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimum routes in a network with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving arc routing problems with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated general windy routing problem with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Algorithms: An Evaluation Using Real Road Networks / rank
 
Normal rank

Latest revision as of 21:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Route planning with turn restrictions: A computational experiment
scientific article

    Statements