In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality. Link to the article
ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2013). Optimal solutions for routing problems with profits. Discrete Applied Mathematics, 161(4-5), pp. 547-557.