New lower bounds for the Capacitated Arc Routing Problem

W.l. Pearn*

*Corresponding author for this work

Research output: Contribution to journalArticle

19 Scopus citations


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.

Original languageEnglish
Pages (from-to)181-191
Number of pages11
Issue number3
StatePublished - 1 Jan 1988

Fingerprint Dive into the research topics of 'New lower bounds for the Capacitated Arc Routing Problem'. Together they form a unique fingerprint.

  • Cite this