Answers are grounded in this paper and cite their sources.
This paper deals with a generalized version of the Travelling Salesman Problem, which consists of finding the shortest Hamiltonian cycle through n sets of nodes. The problem is formulated as an integer linear program including degree constraints, subtour elimination constraints, and integrality constraints. A branch and bound algorithm is used for the solution of the problem; the main feature of the algorithm lies in the relaxation of the subtour elimination constraints. Computational results for Euclidean and non-Euclidean problems are reported.
No takes yet. Share an insight, caveat, or question.
Laporte et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: