A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Open Webpage

Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic

Published: 01 Jan 2019, Last Modified: 30 Sept 2024Eur. J. Oper. Res. 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•A new upper bound for the maximum edge-weighted clique problem is proposed.•A new exact maximum edge-weighTed clique algorithm is proposed.•In-depth empirical evaluation of the new algorithm and claims made are presented.

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview