You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A BRANCH AND BOUND ALGORITHM FOR SOLVING A GENERALIZED TRAVELING SALESMAN PROBLEM
Vladimir Dimitrijević, Milan Milosavljević and Milan Marković
Publikacije Elektrotehničkog fakulteta. Serija Matematika
No. 7 (1996), pp. 31-35
Published by: University of Belgrade, Serbia
Stable URL: http://www.jstor.org/stable/43666465
Page Count: 5
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Following the basic model of the Traveling Salesman Problem (TSP), we consider a more general combinatorial optimisation problem: TSP on multipartite (mp) digraphs, known as Generalised TSP (GTSP). The GTSP can be stated as: flnd a minimum cost cycle which includes exactly one vertex from each supervertex in an mp-digraph. We propose a branch and bound algorithm for solving the GTSP which is based on the minimal rooted tree as a relaxation. Presented experimental results point to the problem dimension up to which it can be solved in a reasonable time, depending on the available computer resources.
Publikacije Elektrotehničkog fakulteta. Serija Matematika © 1996 University of Belgrade, Serbia