How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations.
Sid Ahmed Ali TouatiSébastien BriaisKarine DeschinkelPublished in: RAIRO Oper. Res. (2013)
Keyphrases
- shortest path
- shortest path problem
- road network
- shortest path algorithm
- travel time
- scheduling algorithm
- routing algorithm
- optimal path
- path length
- dijkstra algorithm
- scheduling problem
- flow graph
- geodesic distance
- minimal surface
- evolutionary algorithm
- path selection
- weighted graph
- edge weights
- shortest distance
- lower bound