A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

Pablo San Segundo, Fabio Furini, Jorge Artieda. A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Computers & OR, 110:18-33, 2019. [doi]

Authors

Pablo San Segundo

This author has not been identified. Look up 'Pablo San Segundo' in Google

Fabio Furini

This author has not been identified. Look up 'Fabio Furini' in Google

Jorge Artieda

This author has not been identified. Look up 'Jorge Artieda' in Google