Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique.
Chu-Min LiHua JiangRuchu XuPublished in: LION (2015)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- combinatorial optimization
- maximum clique
- optimal solution
- lower bounding
- precedence constraints
- search tree
- randomly generated problems
- upper bounding
- boolean satisfiability
- single machine scheduling problem
- search space
- max sat
- mixed integer linear programming
- variable ordering
- branch and bound method
- finding an optimal solution
- integer variables
- special case
- lagrangian relaxation
- column generation
- integer programming
- search algorithm