Return to results
Journal articles (2019), European Journal of Operational Research, 278, pp. 76-90

A New Branch-And-Bound Algorithm for the Maximum E Dge-Weighte D Clique Problem

SAN SEGUNDO P., CONIGLIO S., FURINI F., LJUBIC Ivana

We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex- weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of

SAN SEGUNDO, P., CONIGLIO, S., FURINI, F. and LJUBIC, I. (2019). A New Branch-And-Bound Algorithm for the Maximum E Dge-Weighte D Clique Problem. European Journal of Operational Research, 278, pp. 76-90.