The Clustered Orienteering Problem
We introduce a new problem, the Clustered Orienteering Problem (COP), which has strong applications in practice. We propose a formulation for the COP and several valid inequalities. We developed heuristic and exact algorithms to solve the COP.
orienteering problem branch-and-cut tabu search