摘要
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.
出处
《大学数学》
1993年第4期66-72,共7页
College Mathematics
