|
|||||
|
|
| A solvble case of the Capacitated Chinese Postman Problem | |
| 摘 要： | <正> The Capacitated Chinese Postman Problem(CCPP)is NP—hard.However,there aresome solvable cases.In this paper we show that a CCPP is solvable provided all arcs'de-mands are larger than one third of the vehicle's capacity. |
A solvble case of the Capacitated Chinese Postman Problem |
|
| Abstract: | |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ | |