Journal Search Engine

ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)

Journal of Society of Korea Industrial and Systems Engineering Vol.13 No.22 pp.65-69
DOI :

Survey of Traveling Salesman Problem

Kim Chang-Eun

Received Finally Revised Accepted

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.

Key Words :

초록

키워드 :

This article has been cited by 0 article in crossref

Cited-By

Survey of Traveling Salesman Problem

Abstract

초록

Figure

Table

Reference