A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman ProblemGlaubos Clímaco, Luidi Simonetti and Isabel RossetiRAIRO-Oper. Res., 55 (2021) S719-S726DOI: https://doi.org/10.1051/ro/2020002