A branch-and-bound algorithm for the linear ordering problem with cumulative costs.
Giovanni RighiniPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- optimal solution
- np hard
- upper bound
- lower bounding
- test problems
- precedence constraints
- upper bounding
- integer variables
- lagrangian relaxation
- randomly generated problems
- combinatorial optimization
- mixed integer linear programming
- single machine scheduling problem
- total cost
- variable ordering
- search algorithm
- branch and bound method
- search space
- finding an optimal solution
- max sat
- maximum clique
- computational complexity