3 citations · 5 across the 2 of their papers we have counts for
2 papers
math.OC2020★ 3 cited
A revisited branch-and-cut algorithm for large-scale orienteering problems
Gorka Kobeaga, María Merino, Jose A. Lozano
The orienteering problem is a route optimization problem which consists in finding a simple cycle that maximizes the total collected profit subject to a maximum distance limitation…
cs.DS2020★ 2 cited
On Solving Cycle Problems with Branch-and-Cut: Extending Shrinking and Exact Subcycle Elimination Separation Algorithms
Gorka Kobeaga, María Merino, Jose A. Lozano
In this paper, we extend techniques developed in the context of the Travelling Salesperson Problem for cycle problems. Particularly, we study the shrinking of support graphs and th…