Solving Traveling Salesperson Problem on a Network of Personal Computers
碩士 === 銘傳大學 === 資訊管理研究所 === 88 === The traveling salesperson problem is a classic and famous problem in combinatorial optimization research. This problem can be adapted to an entire class of NP-complete problems. To find an efficient way to resolve those problems relating to the traveling salesperso...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87775737320719676034 |