Solving the maximum vertex weight clique problem via binary quadratic programming
- 345 Downloads
In recent years, the general binary quadratic programming (BQP) model has been widely applied to solve a number of combinatorial optimization problems. In this paper, we recast the maximum vertex weight clique problem (MVWCP) into this model which is then solved by a probabilistic tabu search algorithm designed for the BQP. Experimental results on 80 challenging DIMACS-W and 40 BHOSLIB-W benchmark instances demonstrate that this general approach is viable for solving the MVWCP problem.
KeywordsMaximum vertex weight clique Binary quadratic programming Probabilistic tabu search
We are grateful to the reviewers and the editors for their comments which help us to improve the paper. This work was supported by National Natural Science Foundation of China (Grant Nos. 71501157, 71172124), China Postdoctoral Science Foundation (Grant No. 2015M580873) and Northwestern Polytechnical University (Grant No. 3102015RW007).
- Ballard D, Brown C (1983) Computer vision. Prentice-Hall, Englewood CliffsGoogle Scholar
- Li C, Quan Z (2010) An efficient branch-and-bound algorithm based on MAXSAT for the maximum clique problem. In: Proceedings of the 24th AAAI conference on artificial intelligence, pp 128–133Google Scholar
- Warren JS, Hicks IV (2006) Combinatorial branch-and-bound for the maximum weight independent set problem. Technical Report, Texas A&M UniversityGoogle Scholar
- Xu JF, Chiu SY, Glover F (1996) Probabilistic tabu search for telecommunications network design. Comb Optim Theory Pract 1(1):69–94Google Scholar