A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353): Difference between revisions

The authors consider the \(b\)-clique polytope which includes as special case the Boolean quadric polytope (as feasability set of the max cut problem) and which is itself a subset of the quadratic knapsack polyhedron. The polyhedral relations between the three types of polyhedra and new results on the \(b\)-clique polytope yield a large number of facet defining inequalities. These are combined with a Lagrangean relaxation to obtain very promissing numerical results for the edge-weighted clique problem.