Solving the team orienteering problem with cutting planes

We evaluated our algorithm on the standard benchmark of TOP. The results show that the algorithm is competitive and is able to prove the optimality for 12 instances previously unsolved.