{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:54:15Z","timestamp":1648968855004},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0167-6377(93)90021-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"123-127","source":"Crossref","is-referenced-by-count":17,"title":["On the mixed Chinese postman problem"],"prefix":"10.1016","volume":"14","author":[{"given":"T.K.","family":"Ralphs","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"Suppl. 1","key":"10.1016\/0167-6377(93)90021-8_BIB1","first-page":"B73","article-title":"The Chinese postman's problem","volume":"13","author":"Edmonds","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(93)90021-8_BIB2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(93)90021-8_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0167-6377(93)90021-8_BIB4","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","article-title":"Approximation algorithms for some postman problems","volume":"26","author":"Frederickson","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(93)90021-8_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(79)90016-7","article-title":"The mixed postman problem","volume":"1","author":"Kappauf","year":"1979","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-6377(93)90021-8_BIB6","first-page":"273","article-title":"Graphic programming using odd and even points","volume":"1","author":"Kwan","year":"1962","journal-title":"Chinese Math."},{"key":"10.1016\/0167-6377(93)90021-8_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","article-title":"A fundamental problem in vehicle routing","volume":"4","author":"Orloff","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0167-6377(93)90021-8_BIB8","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","article-title":"On the complexity of edge traversing","volume":"23","author":"Papadimitriou","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(93)90021-8_BIB9","article-title":"Contributions to routing problems","author":"Win","year":"1987"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637793900218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637793900218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:52:11Z","timestamp":1552888331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637793900218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["0167637793900218"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90021-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}