{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:55:56Z","timestamp":1763535356468},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10479-015-1977-3","type":"journal-article","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T15:31:11Z","timestamp":1441294271000},"page":"675-692","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On games arising from multi-depot Chinese postman problems"],"prefix":"10.1007","volume":"235","author":[{"given":"Trine Torn\u00f8e","family":"Platz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Hamers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"1977_CR1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.dam.2014.03.002","volume":"172","author":"J Albizuri","year":"2014","unstructured":"Albizuri, J., & Hamers, H. (2014). Graphs inducing totally balanced and submodular Chinese postman games. Discrete Applied Mathematics, 172, 98\u2013103.","journal-title":"Discrete Applied Mathematics"},{"key":"1977_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10479-013-1439-8","volume":"222","author":"D Bednay","year":"2014","unstructured":"Bednay, D. (2014). Stable sets in one-seller assignment games. Annals of Operations Research, 222, 143\u2013152.","journal-title":"Annals of Operations Research"},{"key":"1977_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1016300218643","volume":"109","author":"G Berganti\u00f1os","year":"2002","unstructured":"Berganti\u00f1os, G., & S\u00e1nchez, E. (2002). How to distribute costs associated with a delayed project. Annals of Operations Research, 109, 159\u2013174.","journal-title":"Annals of Operations Research"},{"key":"1977_CR4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.geb.2009.11.001","volume":"69","author":"A Bogomolnaia","year":"2010","unstructured":"Bogomolnaia, A., & Moulin, H. (2010). Sharing a minimal cost spanning tree: Beyond the Folk solution. Games and Economic Behavior, 69, 238\u2013248.","journal-title":"Games and Economic Behavior"},{"key":"1977_CR5","volume-title":"Cooperative game theory and applications: Cooperative games arising from combinatorial optimization problems","author":"I Curiel","year":"2010","unstructured":"Curiel, I. (2010). Cooperative game theory and applications: Cooperative games arising from combinatorial optimization problems. Dordrecht: Kluwer."},{"key":"1977_CR6","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X Deng","year":"2000","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H., & Zang, W. (2000). Totally balanced combinatorial optimization games. Mathematical Programming, 87, 441\u2013452.","journal-title":"Mathematical Programming"},{"key":"1977_CR7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., & Johnson, E. (1973). Matching, Euler tours and the Chinese postman. Mathematical Programming, 5, 88\u2013124.","journal-title":"Mathematical Programming"},{"key":"1977_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1023\/A:1018935324969","volume":"82","author":"S Engevall","year":"1998","unstructured":"Engevall, S., G\u00f6the-Lundgren, M., & V\u00e4rbrand, P. (1998). The traveling salesman game: An application of cost allocation in a gas and oil company. Annals of Operations Research, 82, 453\u2013471.","journal-title":"Annals of Operations Research"},{"key":"1977_CR9","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.ejor.2011.08.015","volume":"216","author":"A Est\u00e9vez-Fern\u00e1ndez","year":"2012","unstructured":"Est\u00e9vez-Fern\u00e1ndez, A. (2012). A game theoretical approach to sharing penalties and rewards in projects. European Journal of Operational Research, 216, 647\u2013657.","journal-title":"European Journal of Operational Research"},{"key":"1977_CR10","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.ejor.2010.06.025","volume":"210","author":"M Fiestras-Janeiro","year":"2011","unstructured":"Fiestras-Janeiro, M., Garc\u00eda-Jurado, I., Meca, A., & Mosquera, M. (2011). Cooperative game theory and inventory management. European Journal of Operational Research, 210, 459\u2013466.","journal-title":"European Journal of Operational Research"},{"key":"1977_CR11","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01580585","volume":"34","author":"D Granot","year":"1986","unstructured":"Granot, D. (1986). A generalized linear production model: A unifying model. Mathematical Programming, 34, 212\u2013222.","journal-title":"Mathematical Programming"},{"key":"1977_CR12","doi-asserted-by":"crossref","first-page":"2054","DOI":"10.1016\/j.dam.2012.04.002","volume":"160","author":"D Granot","year":"2012","unstructured":"Granot, D., & Granot, F. (2012). On graphs which can or cannot induce Chinese Postman games with a non-empty core. Discrete Applied Mathematics, 160, 2054\u20132059.","journal-title":"Discrete Applied Mathematics"},{"key":"1977_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2014.07.021","volume":"179","author":"D Granot","year":"2014","unstructured":"Granot, D., Granot, F., & Ravichandran, H. (2014). The $$k$$ k -centrum Chinese Postman delivery problem and a related cost allocation game. Discrete Applied Mathematics, 179, 100\u2013108.","journal-title":"Discrete Applied Mathematics"},{"key":"1977_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D Granot","year":"1981","unstructured":"Granot, D., & Huberman, G. (1981). Minimum cost spanning tree games. Mathematical Programming, 21, 1\u201318.","journal-title":"Mathematical Programming"},{"key":"1977_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(03)00225-7","volume":"134","author":"D Granot","year":"2004","unstructured":"Granot, D., & Hamers, H. (2004). On the equivalence between some local and global Chinese postman and traveling salesman graphs. Discrete Applied Mathematics, 134, 67\u201376.","journal-title":"Discrete Applied Mathematics"},{"key":"1977_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s101070050093","volume":"86","author":"D Granot","year":"1999","unstructured":"Granot, D., Hamers, H., & Tijs, S. (1999). On some balanced, totally balanced and submodular delivery games. Mathemathical Programming, 86, 355\u2013366.","journal-title":"Mathemathical Programming"},{"key":"1977_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0377-2217(96)00015-X","volume":"99","author":"H Hamers","year":"1997","unstructured":"Hamers, H. (1997). On the concavity of delivery games. European Journal of Operations Research, 99, 445\u2013458.","journal-title":"European Journal of Operations Research"},{"key":"1977_CR18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0377-2217(98)00310-5","volume":"118","author":"H Hamers","year":"1999","unstructured":"Hamers, H., Borm, P., van de Leensel, R., & Tijs, S. (1999). Cost allocation in the Chinese postman problem. European Journal of Operations Research, 118, 153\u2013163.","journal-title":"European Journal of Operations Research"},{"key":"1977_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10479-005-2252-9","volume":"137","author":"H Hamers","year":"2005","unstructured":"Hamers, H., Klijn, F., & van Velzen, B. (2005). On the convexity of precedence sequencing games. Annals of Operations Research, 137, 161\u2013175.","journal-title":"Annals of Operations Research"},{"key":"1977_CR20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10107-013-0655-y","volume":"145","author":"H Hamers","year":"2014","unstructured":"Hamers, H., Miguel, S., & Norde, H. (2014). Monotonic stable solutions for minimum coloring games. Mathematical Programming, 145, 509\u2013529.","journal-title":"Mathematical Programming"},{"issue":"3","key":"1977_CR21","first-page":"613","volume":"123","author":"Y Herer","year":"1995","unstructured":"Herer, Y., & Penn, M. (1995). Characterization of naturally submodular graphs: A polynomial solvable class of the TSP. Proceedings of the American Mathematical Society, 123(3), 613\u2013619.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"1977_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1504\/IJMHEUR.2010.033124","volume":"1","author":"A Kansou","year":"2010","unstructured":"Kansou, A., & Yassine, A. (2010). New upper bounds for the multi-depot capacitated arc routing problem. International Journal of Metaheuristics, 1(1), 81\u201395.","journal-title":"International Journal of Metaheuristics"},{"key":"1977_CR23","first-page":"73","volume":"2","author":"M Maschler","year":"1972","unstructured":"Maschler, M., Peleg, B., & Shapley, L. (1972). The kernel and bargaining set of convex games. International Journal of Game Theory, 2, 73\u201393.","journal-title":"International Journal of Game Theory"},{"key":"1977_CR24","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0377-2217(02)00913-X","volume":"156","author":"A Meca","year":"2004","unstructured":"Meca, A., Timmer, J., Garc\u00eda-Jurado, I., & Borm, P. (2004). Inventory games. European Journal of Operational Research, 156, 127\u2013139.","journal-title":"European Journal of Operational Research"},{"key":"1977_CR25","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s001860300284","volume":"58","author":"Y Okamoto","year":"2003","unstructured":"Okamoto, Y. (2003). Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research, 58, 131\u2013139.","journal-title":"Mathematical Methods of Operations Research"},{"key":"1977_CR26","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C Orloff","year":"1974","unstructured":"Orloff, C. (1974). A fundamental problem of vehicle routing. Networks, 4, 35\u201362.","journal-title":"Networks"},{"key":"1977_CR27","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G Owen","year":"1975","unstructured":"Owen, G. (1975). On the core of linear production games. Mathematical Programming, 9, 358\u2013370.","journal-title":"Mathematical Programming"},{"key":"1977_CR28","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585702","volume":"53","author":"J Potters","year":"1992","unstructured":"Potters, J., Curiel, I., & Tijs, S. (1992). Traveling salesman games. Mathematical Programming, 53, 199\u2013211.","journal-title":"Mathematical Programming"},{"key":"1977_CR29","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"1977_CR30","doi-asserted-by":"crossref","unstructured":"Shapley, L., & Shubik, M. (1973). The assignment game I: The core. International Journal of Game Theory, 1, 111\u2013130.","DOI":"10.1007\/BF01753437"},{"key":"1977_CR31","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10479-005-2253-8","volume":"137","author":"M Slikker","year":"2005","unstructured":"Slikker, M. (2005). Balancedness of sequencing games with multiple parallel machines. Annals of Operations Research, 137, 177\u2013189.","journal-title":"Annals of Operations Research"},{"key":"1977_CR32","volume-title":"The Vehicle routing problem: Latest advances and new challenges","author":"S W\u00f8hlk","year":"2008","unstructured":"W\u00f8hlk, S. (2008). A decade of capacitated arc routing problem. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The Vehicle routing problem: Latest advances and new challenges. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1977-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1977-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1977-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:10:02Z","timestamp":1559153402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1977-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["1977"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1977-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,3]]}}}