Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a ...
This is a preview. Log in through your library . Abstract Following the basic model of the Traveling Salesman Problem (TSP), we consider a more general combinatorial optimisation problem: TSP on ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback