A branch and bound algorithm for the robust spanning tree problem with interval data.
Roberto MontemanniLuca Maria GambardellaPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- interval data
- branch and bound algorithm
- minmax regret
- single machine scheduling problem
- lower bound
- branch and bound
- upper bound
- shortest path problem
- optimal solution
- temporal data
- data clustering
- np hard
- combinatorial optimization
- precedence constraints
- multivariate data
- lagrangian relaxation
- shortest path
- linear programming
- search space
- lower and upper bounds