A constrained binary knapsack approximation for shortest path network interdiction.
Justin YatesKavitha LakshmananPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- shortest path
- shortest path algorithm
- path length
- dijkstra algorithm
- shortest path problem
- optimal path
- finding the shortest path
- road network
- path selection
- flow graph
- source node
- spatial networks
- shortest distance
- knapsack problem
- dynamic programming
- weighted graph
- network traffic
- travel time
- upper bound
- routing algorithm
- transportation networks
- optimal solution
- peer to peer
- minimal surface
- optimization problems
- edge weights
- strongly connected components