{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:14Z","timestamp":1759847234648},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00225-7","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T10:54:32Z","timestamp":1058352872000},"page":"67-76","source":"Crossref","is-referenced-by-count":13,"title":["On the equivalence between some local and global Chinese postman and traveling salesman graphs"],"prefix":"10.1016","volume":"134","author":[{"given":"Daniel","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Hamers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00225-7_BIB1","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\/S0166-218X(03)00225-7_BIB2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(99)00167-5","article-title":"Naturally submodular digraphs and forbidden digraph configurations","volume":"100","author":"Granot","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00225-7_BIB3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s101070050093","article-title":"On some balanced, totally balanced and submodular delivery games","volume":"86","author":"Granot","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00225-7_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0377-2217(98)00310-5","article-title":"Cost allocation in the Chinese postman problem","volume":"118","author":"Hamers","year":"1999","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(03)00225-7_BIB5","first-page":"613","article-title":"Characterization of naturally submodular graphs","volume":"123","author":"Herer","year":"1995","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(03)00225-7_BIB6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0022-0531(81)90007-7","article-title":"Super-modularity","volume":"25","author":"Ichiishi","year":"1981","journal-title":"J. Econom. Theory"},{"key":"10.1016\/S0166-218X(03)00225-7_BIB7","unstructured":"J. Kuipers, A polynomial time algorithm for computing the nucleolus of convex games, Research Memorandum 96-12, Department of Mathematics, University of Maastricht, The Netherlands, 1996."},{"key":"10.1016\/S0166-218X(03)00225-7_BIB8","unstructured":"E. Lawler, J.K. Lenstra, A. Rinnooy Kan, D. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, UK, 1989."},{"key":"10.1016\/S0166-218X(03)00225-7_BIB9","first-page":"73","article-title":"The kernel and bargaining set of convex games","volume":"2","author":"Maschler","year":"1972","journal-title":"Internat. J. Game Theory"},{"key":"10.1016\/S0166-218X(03)00225-7_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585702","article-title":"Traveling salesman games","volume":"53","author":"Potters","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00225-7_BIB11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","article-title":"Cores of convex games","volume":"1","author":"Shapley","year":"1971","journal-title":"Internat. J. Game Theory"},{"key":"10.1016\/S0166-218X(03)00225-7_BIB12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-6377(89)90030-8","article-title":"On the core of a traveling salesman cost allocation game","volume":"8","author":"Tamir","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(03)00225-7_BIB13","series-title":"Game Theory and Mathematical Economics","first-page":"123","article-title":"Bounds for the core and the \u03c4-value","author":"Tijs","year":"1981"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:51:27Z","timestamp":1552816287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03002257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03002257"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00225-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}