Download citation

A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem

RAIRO-Oper. Res., 55 (2021) S719-S726
DOI: https://doi.org/10.1051/ro/2020002