Answers are grounded in this paper and cite their sources.
The Capacitated Arc Routing Problem (CARP), a generalization of the arc routing problems such as the Chinese Postman Problem (CPP), is a very practical distribution management problem which has many real‐world applications. This paper briefly reviews two existing lower bounding procedures—the Matching Lower Bound and the Node Scanning Lower Bound, then introduces a new bounding technique to provide tighter lower bounds on the problem solutions.
No takes yet. Share an insight, caveat, or question.
Wen Lea Pearn (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: