{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:53:00Z","timestamp":1770508380641,"version":"3.49.0"},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6614,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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\u2010world applications. This paper briefly reviews two existing lower bounding procedures\u2014the Matching Lower Bound and the Node Scanning Lower Bound, then introduces a new bounding technique to provide tighter lower bounds on the problem solutions.<\/jats:p>","DOI":"10.1002\/net.3230180305","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T23:23:25Z","timestamp":1178925805000},"page":"181-191","source":"Crossref","is-referenced-by-count":23,"title":["New lower bounds for the Capacitated Arc Routing Problem"],"prefix":"10.1002","volume":"18","author":[{"given":"Wen Lea","family":"Pearn","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"A.Assad W. L.Pearn andB.Golden The capacitated Chinese postman problem: Lower bounds and solvable cases forthcoming inAm. J. Math. Management Sci. in press."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040106"},{"key":"e_1_2_1_4_2","unstructured":"E.Benavent V.Campos A.Corberan andE.Mota A heuristic algorithm for the capacitated Chinese postman problem. Paper presented at the Seventh European or Congress Bologna Italy (1985)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90030-8"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90049-X"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(73)90089-3"},{"key":"e_1_2_1_8_2","unstructured":"N.Christofides V.Campos A.Corboran andE.Mota An algorithm for the rural postman problem. Imperial College Technical Report ICOR 81\u20105 London (1981)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_2_1_10_2","volume-title":"Computers and Intractability","author":"Garey M.","year":"1979"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90026-6"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110308"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321974"},{"key":"e_1_2_1_14_2","unstructured":"W. L.Pearn Approximate solutions for the capacitated arc routing problem. Submitted for publication."},{"key":"e_1_2_1_15_2","unstructured":"W. L.Pearn A.Assad andB.Golden Transforming arc routing into node routing problems.Computers & Operations Res. in press."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(79)90005-4"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T20:04:27Z","timestamp":1697918667000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["10.1002\/net.3230180305"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180305","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}