On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Chu-Min Li, Hua Jiang, Felip Manyà

Abstract: Highlights•Incremental MaxSAT reasoning is effective to reduce branches in MaxClique algorithms.•An efficient static strategy for reducing branches in MaxClique algorithms is proposed.•Combining a static and a dynamic strategy highly improves BnB MaxClique algorithms.•The new highly efficient MaxClique algorithms DoMC2, SoMC2 and MoMC are described.