This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem
where each demand edge is associated with a profit that is collected once if the edge is serviced, independent
of ...