Using Triscanning Algorithm to Solve the Traveling Salesman Problem
碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 93 === The Traveling Salesman Problem (TSP) is a classic combinatorial optimization NP-complete problem. The TSP problem is found in salesman routing problem and other domains, computer science, management science and operating research many researchers have tried...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ftf3m2 |