Now showing items 1-2 of 2
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms
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 ...
An efficient evolutionary algorithm for the orienteering problem
This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ...