Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)
- Volume 13 Issue 22
- /
- Pages.65-69
- /
- 1990
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
Survey of Traveling Salesman Problem
Abstract
Two different algorithms for traveling salesman problem(TSP) will be discussed. One is the engineering approach to the TSP. The other one is Branch-and-Bound algorithm to take advantage of the special structure of combinational problems. Also a generalization of TSP will be presented.
Keywords