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

@article{Maslov2014SpeedingUB,
  title={Speeding up branch and bound algorithms for solving the maximum clique problem},
  author={Eugene Maslov and Mikhail Batsyn and Panos M. Pardalos},
  journal={J. Global Optimization},
  year={2014},
  volume={59},
  pages={1-21}
}
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. (2010) and MAXSAT algorithm by Li and Quan (2010a, b). We suggest a general approach which allows us to speed up considerably these… CONTINUE READING