Solving the maximum vertex weight clique problem via binary quadratic programming

International audience

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.

Record OverviewReadCite

The content you want is available to Zendy users.

Already have an account? Sign in

Sign up to Zendy

Having issues? Contact support