Improved Solutions for the Chinese Postman Problem on Mixed Network
碩士 === 國立交通大學 === 工業工程與管理學系 === 85 === The Chinese postman problem (CPP) is that of finding a shortest postman tour covering all the edges in the road network. The CPP is polynomial-time solvable on directed or undirected networks, bu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/70724079094578145907 |