scientific article; zbMATH DE number 4012343

From MaRDI portal
Publication:3762096





[For the entire collection see Zbl 0619.00006.] This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters, in the case where the distance matrix is asymmetrical. The problem is formulated as an integer linear program. A relaxation of this program possessing a network structure is then considered. The relaxed problem is solved by embedding a network flow routine into a branch and bound algorithm. Some versions of the algorithm make use of Lagrangan relaxation. Computational results are reported.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762096)