{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:44:33Z","timestamp":1751877873817},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12373,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1016\/0166-218x(79)90016-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"89-103","source":"Crossref","is-referenced-by-count":16,"title":["The mixed postman problem"],"prefix":"10.1016","volume":"1","author":[{"given":"Charles H.","family":"Kappauf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary J.","family":"Koehler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(79)90016-7_BIB1","series-title":"On the generalized set covering problem","author":"Andrew","year":"1968"},{"key":"10.1016\/0166-218X(79)90016-7_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipal waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0166-218X(79)90016-7_BIB3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematick"},{"key":"10.1016\/0166-218X(79)90016-7_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","article-title":"Generalized upper bounding techniques","volume":"1","author":"Dantzig","year":"1967","journal-title":"J. Computer Sys. Sci"},{"key":"10.1016\/0166-218X(79)90016-7_BIB5","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\/0166-218X(79)90016-7_BIB6","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(79)90016-7_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(79)90016-7_BIB8","series-title":"Ph. D. Dissertation","article-title":"The postman problem","author":"Kappauf","year":"1975"},{"key":"10.1016\/0166-218X(79)90016-7_BIB9","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1287\/opre.19.4.998","article-title":"Set covering by single branch enumeration with linear programming sub-problems","volume":"19","author":"Lemke","year":"1971","journal-title":"Operations Res."},{"key":"10.1016\/0166-218X(79)90016-7_BIB10","series-title":"Applied Graph Theory","author":"Marshall","year":"1971"},{"key":"10.1016\/0166-218X(79)90016-7_BIB11","series-title":"ORC 67-12","article-title":"The symmetric assignment problem","author":"Murty","year":"1967"},{"key":"10.1016\/0166-218X(79)90016-7_BIB12","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"},{"issue":"3","key":"10.1016\/0166-218X(79)90016-7_BIB13","first-page":"544","article-title":"On the complexity of edge-traversing","volume":"23","author":"Papadimitriou","year":"1976","journal-title":"J.C.M."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X79900167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:41Z","timestamp":1555136621000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X79900167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["0166218X79900167"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(79)90016-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}