A solvble case of the Capacitated Chinese Postman Problem

被引：0

作者：

Xiang Siming (Anhui Institute of Architectural Technology

PRC)

机构：

来源：

工科数学 | 1993年 / 04期

关键词：

CCPP; In; A solvble case of the Capacitated Chinese Postman Problem; case;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

<正> 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.

引用

页码：66 / 72

页数：7