A branch-and-bound algorithm for the coupled task problem.
József BékésiGábor GalambosMichael N. JungMarcus OswaldGerhard ReineltPublished in: Math. Methods Oper. Res. (2014)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- optimal solution
- np hard
- combinatorial optimization
- lower bounding
- test problems
- precedence constraints
- randomly generated problems
- mixed integer linear programming
- search tree
- single machine scheduling problem
- max sat
- branch and bound method
- variable ordering
- lagrangian relaxation
- upper bounding
- maximum clique
- finding an optimal solution
- column generation
- simulated annealing
- search space
- weighted max sat
- search algorithm
- neural network