No Detail Found!

Searching of optimal vertices in a haphazard routes.

Author(s)
N. Khan Department of Mathematics, University of Karachi, Karachi, Pakistan
F. H. Khan Department of Mathematics, University of Karachi, Karachi, Pakistan
S. Inayat Ullah Department of Mathematics, University of Karachi, Karachi, Pakistan
Abstract
In this paper we are going to develop a new and efficient algorithm for finding a shortest cyclic tour of the network with the repetition of each vertex at least once. Problem under consideration is a traveling salesman problem, for repeating vertex. Penalizing the distance and choosing the shortest tour has been achieved from the weighted matrix of the graph.
Publication Details
Page(s) 85-88
DOI DOI not available
Published Journal: Sindh University Research Journal, Volume: 40, Issue: 2, Year: 2008

Request the full text from PASTIC

0

Citations

0

Downloads

22

Views