A branch-and-cut algorithm for the maximum covering cycle problem
Crossref DOI link: https://doi.org/10.1007/s10479-018-2856-5
Published Online: 2018-04-11
Published Print: 2020-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Álvarez-Miranda, Eduardo
Sinnl, Markus
Text and Data Mining valid from 2018-04-11
Article History
First Online: 11 April 2018