Dynamic graph generation for the shortest path problem in time expanded networks.
Frank FischerChristoph HelmbergPublished in: Math. Program. (2014)
Keyphrases
- shortest path problem
- shortest path
- single source
- interval data
- dynamic graph
- combinatorial optimization problems
- edge weights
- network structure
- directed graph
- social networks
- directed acyclic graph
- multiple objectives
- optimization problems
- knapsack problem
- combinatorial optimization
- complex networks
- metaheuristic
- special case