An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
Torsten FahleKarsten TiemannPublished in: WEA (2005)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- randomly generated problems
- np hard
- test problems
- lower bounding
- optimal solution
- search tree
- upper bounding
- precedence constraints
- combinatorial optimization
- single machine scheduling problem
- variable ordering
- lagrangian relaxation
- mixed integer linear programming
- max sat
- branch and bound method
- finding an optimal solution
- maximum clique
- neural network
- search algorithm