A branch-and-cut algorithm for the maximum covering cycle problem

Eduardo Álvarez-Miranda, Markus Sinnl. A branch-and-cut algorithm for the maximum covering cycle problem. Annals OR, 284(2):487-499, 2020. [doi]

@article{Alvarez-Miranda20,
  title = {A branch-and-cut algorithm for the maximum covering cycle problem},
  author = {Eduardo Álvarez-Miranda and Markus Sinnl},
  year = {2020},
  doi = {10.1007/s10479-018-2856-5},
  url = {https://doi.org/10.1007/s10479-018-2856-5},
  researchr = {https://researchr.org/publication/Alvarez-Miranda20},
  cites = {0},
  citedby = {0},
  journal = {Annals OR},
  volume = {284},
  number = {2},
  pages = {487-499},
}