{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:25:27Z","timestamp":1784906727466,"version":"3.55.0"},"reference-count":17,"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":9171,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A capacitated node routing problem, known as the vehicle routing or dispatch problem, has been the focus of much research attention. On the other hand, capacitated arc routing problems have been comparatively neglected. Both classes of problems are extremely rich in theory and applications. Our intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems. In addition, we identify several related routing problems and develop tight lower bounds on the optimal solution.<\/jats:p>","DOI":"10.1002\/net.3230110308","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:52:10Z","timestamp":1178887930000},"page":"305-315","source":"Crossref","is-referenced-by-count":452,"title":["Capacitated arc routing problems"],"prefix":"10.1002","volume":"11","author":[{"given":"Bruce L.","family":"Golden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard T.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040106"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-7097(75)90003-4"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(73)90089-3"},{"key":"e_1_2_1_5_2","volume-title":"Worst\u2010Case Analysis of a New Heuristic for the Traveling Salesman Problem","author":"Christofides N.","year":"1976"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"e_1_2_1_7_2","volume-title":"Computers and Intractability","author":"Garey M.","year":"1979"},{"key":"e_1_2_1_8_2","unstructured":"B.Golden \u201cRecent Developments in Vehicle Routing \u201d in Computers and Mathematical Programming W. White Ed. National Bureau of Standards Special Publication 502 Washington D.C. (1978)233\u2013240."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070203"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060305"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040205"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060306"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.3.517"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.6.920"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"e_1_2_1_18_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.3230110308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:19:40Z","timestamp":1699791580000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,9]]}},"alternative-id":["10.1002\/net.3230110308"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110308","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,9]]}}}