Speeding up branch and bound algorithms for solving the maximum clique problem

In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (<CitationRef CitationID="CR31">2010</CitationRef>) and MAXSAT algorithm by Li and Quan (<CitationRef CitationID="CR21">2010a</CitationRef>, <CitationRef CitationID="CR22">b</CitationRef>). We suggest a general approach which allows us to speed up considerably these branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we apply ILS heuristic by Andrade et al. (J Heuristics 18(4):525–547, <CitationRef CitationID="CR1">2012</CitationRef>). The best results are obtained for p_hat1000-3 instance and gen instances with up to 11,000 times speedup. Copyright Springer Science+Business Media New York 2014