{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:30:21Z","timestamp":1777717821088,"version":"3.51.4"},"reference-count":19,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5062,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity <jats:italic>Q<\/jats:italic>, must service a subset of the edges of a graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. New lower bounds are developed for this problem, producing at least as good results as the already existing ones. Three of the proposed lower bounds are obtained from the resolution of a minimum cost perfect matching problem. The fourth one takes into account the vehicle capacity and is computed using a dynamic programming algorithm. Computational results, in which these bounds are compared on a set of test problems, are included.<\/jats:p>","DOI":"10.1002\/net.3230220706","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:21:06Z","timestamp":1178976066000},"page":"669-690","source":"Crossref","is-referenced-by-count":132,"title":["The Capacitated Arc Routing Problem: Lower bounds"],"prefix":"10.1002","volume":"22","author":[{"given":"E.","family":"Benavent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Corberan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"issue":"1","key":"e_1_2_1_2_2","first-page":"63","article-title":"The capacitated postman problem: Lower bounds and solvable cases","volume":"7","author":"Assad A.","year":"1987","journal-title":"Am. J. Math. Management Sci."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040106"},{"issue":"3","key":"e_1_2_1_4_2","first-page":"479","article-title":"Problemas de Rutas por Arcos","volume":"7","author":"Benavent E.","year":"1983","journal-title":"Questii\u00f3"},{"key":"e_1_2_1_5_2","first-page":"107","article-title":"The capacitated arc routing problem. A heuristic algorithm","volume":"14","author":"Benavent E.","year":"1990","journal-title":"Questii\u00f3"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110204"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90030-8"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90049-X"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(73)90089-3"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589353"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110207"},{"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.1016\/0305-0548(83)90026-6"},{"key":"e_1_2_1_14_2","unstructured":"A.Kolen A. H. G.Rinnooy\u2010Kan andH.Trienekens Vehicle routing with time windows. Report 8433\/O Econometric Institute Erasmus University Rotterdam (1984)."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","first-page":"EE1","DOI":"10.1061\/JEEGAV.0000720","article-title":"Districting and routing for solid waste collection","volume":"104","author":"Male J. W.","year":"1978","journal-title":"J. Environmental Eng. Div."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180305"},{"key":"e_1_2_1_18_2","unstructured":"Y.Saruwatari R.Hirabayashi andN.Nishida Node duplication lower bounds for the capacitated arc routing problem.Proceedings of the Third Euro Club for Combinatorial Optimization Barcelona (1990)."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(79)90005-4"},{"key":"e_1_2_1_20_2","unstructured":"Zaw Win: Contributions to routing problems. PhD Dissertation Universit\u00e4t Augsburg (1988)."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220706","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T09:40:24Z","timestamp":1698054024000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["10.1002\/net.3230220706"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220706","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}