@article{(Open Science Index):https://publications.waset.org/pdf/5402,
	  title     = {Parallel Branch and Bound Model Using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem},
	  author    = {Sheikh Muhammad Azam and  Masood-ur-Rehman and  Adnan Khalid Bhatti and  Nadeem Daudpota},
	  country	= {},
	  institution	= {},
	  abstract     = {Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {6},
	  year      = {2007},
	  pages     = {1752 - 1755},
	  ee        = {https://publications.waset.org/pdf/5402},
	  url   	= {https://publications.waset.org/vol/6},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 6, 2007},
	}