An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 128-133

  Li, Chu Min ^a,b   Quan, Zhe ^b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Branch and Bound; Maxclique; MaxSAT

Indexed keywords

BRANCH AND BOUND METHOD;

BRANCH-AND-BOUND ALGORITHMS; INDEPENDENT SET; MAX-SAT; MAXCLIQUE; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; RANDOM GRAPHS; STATE OF THE ART;

PROBLEM SOLVING;

EID: 77958555959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. Carraghan, P. M. Pardalos, An exact algorithm for the maximum clique problem. Operations Research Letters 9(6): 375-382 (1990)
2. T. Fahle, Simple and fast: Improving a branch-and-bound algorithm for maximum clique. In Proceedings of ESA-2002, pp. 485-498, 2002.
3. F. Heras, J. Larrosa, and A. Oliveras, MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research, 31:1-32, 2008.
4. J. Konc, D. Janezic, An improved branch and bound algorithm for the maximum clique problem, Communications in Mathematical and in Computer Chemistry 58 (2007) pp. 569-590.
5. C. M. Li and F. Manyà Max-sat, hard and soft constraints. In A. Biere, H. van Maaren, and T. Walsh, editors, Handbook of Satisfiability. Pages 613-631, IOS Press, 2009.
6. C. M. Li, F. Manyà and J. Planes, New inference rules for Max-SAT. Journal of Artificial Intelligence Research, 30:321-359, 2007.
7. C. M. Li, F. Manyà and Jordi. Planes, Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat, In Proceedings of AAAI'06, pages 86-91. AAAI Press, 2006.
8. C. M. Li, F. Manyà and J. Planes, Exploiting unit propagation to compute lower bounds in branch and bound MaxSAT solvers, In proceedings ofCP'05, LNCS 3709 Springer, 2005, pp 403-414.
9. P. R. J. Ostergard, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics 120 (2002), 197-207.
10. P. M. Pardalos, J. Xue, The maximum clique problem. Journal of Global Optimization 4: 301-328, 1994
11. W. Pullan, H. H. Hoos, Dynamic Local Search for the Maximum Clique Problem. Journal of Artificial Intelligence Research, Vol. 25, pp. 159-185, 2006. (Pubitemid 43800045)
12. J.-C. Regin, Solving the maximum clique problem with constraint programming. In Proceedings of CPAIOR'03, Springer, LNCS 2883, pp. 634-648, 2003.
13. E. Tomita, T. Kameda, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob Optim (2007) 37:95-111.
14. E. Tomita, T. Seki, An efficient branch-and-bound algorithm for finding a maximum clique. In Proc. Discrete Mathematics and Theoretical Computer Science. LNCS 2731, pp. 278-289 (2003).