1 code implementation • 5 Nov 2020 • Gorka Kobeaga, María Merino, Jose A. Lozano
We propose a revisited version of the branch-and-cut algorithm for the orienteering problem which includes new contributions in the separation algorithms of inequalities stemming from the cycle problem, in the separation loop, in the variables pricing, and in the calculation of the lower and upper bounds of the problem.
Optimization and Control Data Structures and Algorithms
1 code implementation • 30 Apr 2020 • Gorka Kobeaga, María Merino, Jose A. Lozano
Particularly, we study the shrinking of support graphs and the exact algorithms for subcycle elimination separation problems.
Data Structures and Algorithms Combinatorics 05C38, 90C10, 90C57
