A branch and bound algorithm for the robust shortest path problem with interval data.
Roberto MontemanniLuca Maria GambardellaAlberto V. DonatiPublished in: Oper. Res. Lett. (2004)
Keyphrases
- interval data
- shortest path problem
- branch and bound algorithm
- minmax regret
- shortest path
- lower bound
- combinatorial optimization problems
- combinatorial optimization
- branch and bound
- upper bound
- directed graph
- np hard
- optimal solution
- multiple objectives
- single machine scheduling problem
- data clustering
- directed acyclic graph
- precedence constraints
- temporal data
- max sat
- search procedure
- dynamic programming
- lagrangian relaxation
- optimization problems