An efficient evolutionary algorithm for the orienteering problem. - Gorka Kobeaga; María Merino 001; José Antonio Lozano 001 (Comput. Oper. Res., 2018)

A revisited branch-and-cut algorithm for large-scale orienteering problems. - Gorka Kobeaga; María Merino 001; José Antonio Lozano 001 (CoRR, 2020)

On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms. - Gorka Kobeaga; María Merino 001; José Antonio Lozano 001 (Ann. Oper. Res., 2021)

A revisited branch-and-cut algorithm for large-scale orienteering problems. - Gorka Kobeaga; Jairo Rojas-Delgado; María Merino 001; José Antonio Lozano 001 (Eur. J. Oper. Res., 2024)