The first \(K\) shortest unique-arc walks in a traffic-light network
From MaRDI portal
Publication:2486756
DOI10.1016/j.mcm.2005.01.004zbMath1099.90008OpenAlexW2051674842MaRDI QIDQ2486756
Publication date: 17 August 2005
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2005.01.004
Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)
Related Items (1)
Cites Work
- A note on two problems in connexion with graphs
- The quickest path problem
- Shortest Path Algorithms: An Evaluation Using Real Road Networks
- Shortest-path algorithms: Taxonomy and annotation
- Scheduling School Buses
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- An efficient algorithm for K shortest simple paths
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Deterministic network optimization: A bibliography
- Data Structures and Computer Science Techniques in Operations Research
- Finding the k Shortest Paths
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: The first \(K\) shortest unique-arc walks in a traffic-light network
