Heuristic Algorithms for the Maximum Benefit Chinese Postman Problem
碩士 === 國立交通大學 === 運輸工程與管理系 === 87 === The Maximum Benefit Chinese Postman Problem (MBCPP) is a practical generalization of the classical Chinese Postman Problem (CPP), which has many real-world applications. The MBCPP has been shown more complex than the Traveling Salesman Problem (TSP)....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69081631354667581965 |