{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T04:09:48Z","timestamp":1787717388407,"version":"build-2784847793"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1023\/a:1018316919294","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"165-187","source":"Crossref","is-referenced-by-count":71,"title":["The Capacitated Arc Routing Problem: Valid Inequalities and Facets"],"prefix":"10.1007","volume":"10","author":[{"given":"J.M.","family":"Belenguer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Benavent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"156992_CR1","first-page":"63","volume":"7","author":"A. Assad","year":"1987","unstructured":"A. Assad, W. Pearn, and B.L. Golden, \"The capacitated chinese postman problem: Lower bounds and solvable cases,\" American J. of Mathematical and Man. Sci., vol. 7, pp. 63-88, 1987.","journal-title":"American J. of Mathematical and Man. Sci."},{"key":"156992_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0927-0507(05)80109-4","volume":"6","author":"A. Assad","year":"1995","unstructured":"A. Assad and B.L. Golden, \"Arc routing methods and applications,\" Handbook on Operations Research and Management Science, North-Holland, vol. 6, pp. 375-483, 1995.","journal-title":"Handbook on Operations Research and Management Science"},{"key":"156992_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel, \"Facets of the knapsack polytope from minimal covers,\" SIAM Journal on Applied Mathematics, vol. 34, pp. 119-148, 1978.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"156992_CR4","unstructured":"J.M. Belenguer, \"El poliedro del problema de rutas por arcos con capacidades,\" Ph.D. Thesis, Universitat de Valencia, 1990."},{"key":"156992_CR5","unstructured":"J.M. Belenguer and E. Benavent, \u201cPolyhedral results on the capacitated arc routing problem,\u201d Dep. Estad\u00edstica e Inv. Op., T.R. 1-92, Univ. de Valencia, 1992."},{"key":"156992_CR6","unstructured":"J.M. Belenguer, E. Benavent, and F. Cognata, \"A tabu heuristic for the capacitated arc routing problem,\" 1996, in preparation."},{"key":"156992_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"E. Beltrami","year":"1974","unstructured":"E. Beltrami and L. Bodin, \"Networks and vehicle routing for municipal waste collection,\" Networks, vol. 4, pp. 65-94, 1974.","journal-title":"Networks"},{"issue":"1-3","key":"156992_CR8","first-page":"107","volume":"14s.","author":"E. Benavent","year":"1990","unstructured":"E. Benavent, V. Campos, A. Corberan, and E. Mota, \"The capacitated arc routing problem. A heuristic algorithm,\" Questii\u00f3, vol. 14, nos.1-3, pp. 107-122, 1990.","journal-title":"Questii\u00f3"},{"key":"156992_CR9","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E. Benavent","year":"1992","unstructured":"E. Benavent, V. Campos, A. Corberan, and E. Mota, \"The capacitated arc routing problem. Lower bounds,\" Networks, vol. 22, pp. 669-690, 1992.","journal-title":"Networks"},{"key":"156992_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0305-0548(79)90002-9","volume":"6","author":"L.D. Bodin","year":"1979","unstructured":"L.D. Bodin and S.J. Kursh, \"A detailed description of a computer system for the routing and scheduling of street sweepers,\" Computers and Oper. Res., vol. 6, pp. 181-198, 1979.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR11","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/0305-0483(73)90089-3","volume":"1","author":"N. Christofides","year":"1973","unstructured":"N. Christofides, \u201cThe optimum traversal of a graph,\u201d OMEGA, vol. 1, pp. 719-732, 1973.","journal-title":"OMEGA"},{"key":"156992_CR12","unstructured":"CPLEX Version 2.0, CPLEX Optimization Inc., 1992."},{"key":"156992_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G. Cornuejols","year":"1993","unstructured":"G. Cornuejols and F. Harche, \"Polyhedral study of the capacitated vehicle routing problem,\" Mathematical Programming, vol. 60, pp. 21-52, 1993.","journal-title":"Mathematical Programming"},{"key":"156992_CR14","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1057\/jors.1992.160","volume":"43","author":"R.W. Eglese","year":"1992","unstructured":"R.W. Eglese and L.Y.O. Li, \"Efficient routing for winter gritting,\" Journal of the Operational Research Society, vol. 43, pp. 1031-1034, 1992.","journal-title":"Journal of the Operational Research Society"},{"key":"156992_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"H.A. Eiselt, M. Gendreau, and G. Laporte, \"Arc routing problems, Part 1: The Chinese postman problem,\" Operations Research, vol. 43, pp. 231-242, 1995.","journal-title":"Operations Research"},{"key":"156992_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"H.A. Eiselt, M. Gendreau, and G. Laporte, \"Arc routing problems, Part 2: The rural postman problem,\" Operations Research, vol. 43, pp. 399-414, 1995.","journal-title":"Operations Research"},{"key":"156992_CR17","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979."},{"key":"156992_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"B.L. Golden and R. Wong, \"Capacitated arc routing problems,\" Networks, vol. 11, pp. 305-315, 1981.","journal-title":"Networks"},{"key":"156992_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B.L. Golden","year":"1983","unstructured":"B.L. Golden, J.S. DeArmon, and E.K. Baker, \"Computational experiments with algorithms for a class of routing problems,\" Computers and Oper. Res., vol. 10, pp. 47-59, 1983.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb and M.R. Rao, \"The generalized assignment problem: Valid inequalities and facets,\" Mathematical Programming, vol. 46, pp. 31-52, 1990.","journal-title":"Mathematical Programming"},{"key":"156992_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01585726","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb and M.R. Rao, \"(1, k)-Configuration facets for the generalized assignment problem,\" Mathematical Programming, vol. 46, pp. 53-60, 1990.","journal-title":"Mathematical Programming"},{"key":"156992_CR22","unstructured":"F. Harche and G. Rinaldi, \"The capacity inequalities for the capacitated vehicle routing problem,\" 1993, in preparation."},{"key":"156992_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley: New York, 1988."},{"key":"156992_CR24","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M.W. Padberg","year":"1980","unstructured":"M.W. Padberg, \"(1, k)-Configurations and facets for packing problems,\" Mathematical Programming, vol. 18, pp. 94-99, 1980.","journal-title":"Mathematical Programming"},{"key":"156992_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"M.W. Padberg and M.R. Rao, \"Odd minimum cut-sets and b-matchings,\" Mathematics of Oper. Res., vol. 7, pp. 67-80, 1982.","journal-title":"Mathematics of Oper. Res."},{"key":"156992_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M.W. Padberg","year":"1987","unstructured":"M.W. Padberg and G. Rinaldi, \"Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut,\" Operations Research Letters, vol. 6, pp. 1-7, 1987.","journal-title":"Operations Research Letters"},{"key":"156992_CR27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230180305","volume":"18","author":"W.L. Pearn","year":"1988","unstructured":"W.L. Pearn, \"New lower bounds for the capacitated arc routing problems,\" Networks, vol. 18, pp. 181-191, 1988.","journal-title":"Networks"},{"issue":"16","key":"156992_CR28","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/0305-0548(89)90044-0","volume":"1","author":"W.L. Pearn","year":"1989","unstructured":"W.L. Pearn, \"Approximate solutions for the capacitated arc routing problem,\" Computers and Oper. Res., vol. 1, no.16, pp. 589-600, 1989.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0305-0548(91)90089-A","volume":"18","author":"W.L. Pearn","year":"1991","unstructured":"W.L. Pearn, \"Augment-insert algorithms for the capacitated arc routing problem,\" Computers and Oper. Res., no. 18, pp. 189-198, 1991.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR30","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0305-0548(87)90065-7","volume":"14","author":"W.L. Pearn","year":"1987","unstructured":"W.L. Pearn, A.A. Assad, and B. L. Golden \"Transforming arc routing into node routing problems,\" Computers and Oper. Res., no. 14, pp. 285-288, 1987.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR31","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0305-0548(79)90005-4","volume":"6","author":"H. Stern","year":"1979","unstructured":"H. Stern and M. Dror, \"Routing electric meter readers,\" Computers and Oper. Res., vol. 6, pp. 209-223, 1979.","journal-title":"Computers and Oper. Res."},{"key":"156992_CR32","unstructured":"Z. Win, \"Contributions to routing problems,\" Ph.D. Thesis, University of Augsburg, 1988."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018316919294.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018316919294\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018316919294.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:32:05Z","timestamp":1752377525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018316919294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["156992"],"URL":"https:\/\/doi.org\/10.1023\/a:1018316919294","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}