%0 Journal Article %A ClĂ­maco, Glaubos %A Simonetti, Luidi %A Rosseti, Isabel %T A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem %J RAIRO. Operations Research %D 2021 %P S719-S726 %V 55 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2020002/ %R 10.1051/ro/2020002 %G en %F RO_2021__55_S1_S719_0