A branch and bound algorithm for the matrix bandwidth minimization.
Rafael MartíVicente CamposEstefanía PiñanaPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- optimal solution
- upper bound
- test problems
- combinatorial optimization
- np hard
- precedence constraints
- lower bounding
- randomly generated problems
- objective function
- mixed integer linear programming
- lagrangian relaxation
- variable ordering
- upper bounding
- finding an optimal solution
- single machine scheduling problem
- max sat
- branch and bound method
- column generation
- maximum clique
- low rank
- particle swarm optimization