A branch-and-cut algorithm for the Edge Interdiction Clique Problem

Published in Eur. J. Oper. Res. 294(1): 54-69, 2021

View paper here

Download paper here

Bibtex:

@article{DBLP:journals/eor/FuriniLSZ21,
  author    = {Fabio Furini and
               Ivana Ljubic and
               Pablo San Segundo and
               Yanlu Zhao},
  title     = {A branch-and-cut algorithm for the Edge Interdiction Clique Problem},
  journal   = {Eur. J. Oper. Res.},
  volume    = {294},
  number    = {1},
  pages     = {54--69},
  year      = {2021},
  url       = {https://doi.org/10.1016/j.ejor.2021.01.030},
  doi       = {10.1016/j.ejor.2021.01.030},
  timestamp = {Tue, 01 Jun 2021 08:36:27 +0200},
  biburl    = {https://dblp.org/rec/journals/eor/FuriniLSZ21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}