Solving the length constrained K-drones rural postman problem

•We study the length-constrained K-drones 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 and a matheuristic to solve the problem.