A new branch-and-bound algorithm for the maximum edge-weighted clique problem
Lists
Only you see this
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.
BibTeX
@article{segundo2019new,
author = {Pablo San Segundo and Stefano Coniglio and Fabio Furini and Ivana Ljubic},
title = {{A new branch-and-bound algorithm for the maximum edge-weighted clique problem}},
journal = {Eur. J. Oper. Res.},
year = {2019},
url = {https://openreview.net/forum?id=sPQrA5D6k5},
}Loading related content...