A branch and bound algorithm for the maximum diversity problem.
Rafael MartíMicael GallegoAbraham DuartePublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- branch and bound algorithm
- branch and bound
- lower bound
- upper bound
- randomly generated
- combinatorial optimization
- test problems
- lower bounding
- np hard
- search tree
- upper bounding
- optimal solution
- lagrangian relaxation
- precedence constraints
- mixed integer linear programming
- randomly generated problems
- single machine scheduling problem
- branch and bound method
- search algorithm
- variable ordering
- search space
- column generation
- genetic algorithm
- max sat
- integer variables