A new branch-and-bound algorithm for the maximum...

  • Main
  • 2019 / 4
  • A new branch-and-bound algorithm for the maximum...
European Journal of Operational Research 2019 / 4

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

San Segundo, Pablo, Coniglio, Stefano, Furini, Fabio, Ljubić, Ivana
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Journal:
European Journal of Operational Research
DOI:
10.1016/j.ejor.2019.03.047
Date:
April, 2019
File:
PDF, 950 KB
2019
Conversion to is in progress
Conversion to is failed