{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:52:34Z","timestamp":1761893554521},"reference-count":11,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0305-0548(97)00013-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1057-1061","source":"Crossref","is-referenced-by-count":57,"title":["Modeling and solving several classes of arc routing problems as traveling salesman problems"],"prefix":"10.1016","volume":"24","author":[{"given":"Gilbert","family":"Laporte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00013-0_BIB1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","article-title":"Arc routing problems, part I: The Chinese postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems, part II: The rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB3","first-page":"375","article-title":"Arc routing methods and applications","volume":"Vol. 8","author":"Assad","year":"1995"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman problem","volume":"5","author":"Edmonds","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB6","first-page":"39","article-title":"An efficient transformation of the generalized traveling salesman problem","volume":"31","author":"Noon","year":"1993","journal-title":"INFOR"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB7","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric traveling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB8","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<97::AID-NET1>3.0.CO;2-8","article-title":"An optimal algorithm for the mixed Chinese postman problem","volume":"27","author":"Nobert","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(97)00013-0_BIB10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BFb0121091","article-title":"An algorithm for the rural postman problem on a directed graph","volume":"26","author":"Christofides","year":"1986","journal-title":"Mathematical Programming Study"},{"year":"1994","series-title":"Montr\u00e9al and Environs (Street Atlas)","key":"10.1016\/S0305-0548(97)00013-0_BIB11"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000130?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000130?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:32Z","timestamp":1555204892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":11,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0305054897000130"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00013-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}