On the Distance-Constrained Close Enough Arc Routing Problem

•We study the Distance-Constrained Close Enough Arc Routing Problem.•We propose a new mathematical formulation for the problem.•We present several new families of valid inequalities and some procedures for their separation.•We propose a branch-and-cut algorithm to solve the problem and compare it with the best exact procedure in the literature.