|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 65 - Issue 5 |
| Published: March 2013 |
| Authors: Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh |
10.5120/10924-5866
|
Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh . A Proposed Solution to Travelling Salesman Problem using Branch and Bound. International Journal of Computer Applications. 65, 5 (March 2013), 44-49. DOI=10.5120/10924-5866
@article{ 10.5120/10924-5866,
author = { Archit Rastogi,Ankur Kumar Shrivastava,Nitisha Payal,Ramander Singh },
title = { A Proposed Solution to Travelling Salesman Problem using Branch and Bound },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 65 },
number = { 5 },
pages = { 44-49 },
doi = { 10.5120/10924-5866 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Archit Rastogi
%A Ankur Kumar Shrivastava
%A Nitisha Payal
%A Ramander Singh
%T A Proposed Solution to Travelling Salesman Problem using Branch and Bound%T
%J International Journal of Computer Applications
%V 65
%N 5
%P 44-49
%R 10.5120/10924-5866
%I Foundation of Computer Science (FCS), NY, USA
Travelling salesperson problem is a well-known problem. In this problem the minimum cost tour of few cities is needed, which are connected. The cost of different paths is given. The tour should be started from a given node and after completing the tour the travelling salesman has to return to the starting node. The earlier method is given by Greedy programming. In this paper Branch & Bound method is used to solve this problem.