A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.
Torsten FahleKarsten TiemannPublished in: ACM J. Exp. Algorithmics (2006)
Keyphrases
- branch and bound algorithm
- set covering problem
- set covering
- branch and bound
- lower bound
- column generation
- optimal solution
- np hard
- upper bound
- combinatorial optimization
- lower bounding
- test problems
- precedence constraints
- lagrangian relaxation
- randomly generated problems
- integer programming
- max sat
- variable ordering
- single machine scheduling problem
- mixed integer linear programming
- hypergraph model
- finding an optimal solution
- integer program
- network design problem
- branch and bound method
- crew pairing
- approximation algorithms
- constraint satisfaction problems