A branch and bound algorithm for the sequential ordering problem.
Mladen KaranNina Skorin-KapovPublished in: MIPRO (2011)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- optimal solution
- lower bounding
- test problems
- combinatorial optimization
- search tree
- upper bounding
- lagrangian relaxation
- precedence constraints
- randomly generated problems
- mixed integer linear programming
- finding an optimal solution
- branch and bound method
- variable ordering
- max sat
- integer variables
- partial order
- maximum clique
- search algorithm