A branch-and-cut algorithm for the Orienteering Arc Routing Problem
We study a hard arc routing problem with profits. We provide an integer programming formulation for the problem. The associated polyhedron is partially described. We implement a branch-and-cut algorithm based on the partial description. The proposed algorithm can solve instances with up to 2000 vertices and 14,000 arcs
branch-and-cut orienteering arc routing problem routing problems with profits