Ivana LJUBIC

Ivana LJUBIC

Professor of Operations Research at the ESSEC Business School

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

Published in Eur. J. Oper. Res. 278(1): 76-90, 2019

View paper here

Download paper here

Bibtex:

@article{DBLP:journals/eor/SegundoCFL19,
  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.},
  volume    = {278},
  number    = {1},
  pages     = {76--90},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.ejor.2019.03.047},
  doi       = {10.1016/j.ejor.2019.03.047},
  timestamp = {Fri, 21 Feb 2020 13:14:38 +0100},
  biburl    = {https://dblp.org/rec/journals/eor/SegundoCFL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}