The robust shortest path problem with interval data via Benders decomposition.
Roberto MontemanniLuca Maria GambardellaPublished in: 4OR (2005)
Keyphrases
- interval data
- shortest path problem
- shortest path
- benders decomposition
- combinatorial optimization problems
- multiple objectives
- network design problem
- directed acyclic graph
- mixed integer
- data clustering
- directed graph
- temporal data
- neural network
- network design
- multivariate data
- constraint satisfaction problems
- evolutionary algorithm