Cite
HARVARD Citation
San Segundo, P. et al. (2019). A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Computers & operations research. pp. 18-33. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
San Segundo, P. et al. (2019). A new branch-and-bound algorithm for the Maximum Weighted Clique Problem. Computers & operations research. pp. 18-33. [Online].