Search
Now showing items 1-2 of 2
Algorithms for Large Orienteering Problems
(2021-01)
In this thesis, we have developed algorithms to solve large-scale Orienteering Problems. The Orienteering Problem is a combinatorial optimization problem were given a weighted complete graph with vertex profits and a maximum ...
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms
(2021-01-01)
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 the exact algorithms for subcycle elimination ...