On a continuous approach for the maximum weighted clique problem

摘要

This paper is focused on computational study of continuous approach for the maximum weighted clique problem. The problem is formulated as a continuous optimization problem with a nonconvex quadratic constraint given by the difference of two convex functions (d.c. function). The proposed approach consists of two main ingredients: a local search algorithm, which provides us with crucial points; and a procedure which is based on global optimality condition and which allows us to escape from such points. The efficiency of the proposed algorithm is illustrated by computational results.