{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:35:16Z","timestamp":1761896116138,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100000739","name":"University of Southampton","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000739","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s13675-015-0042-y","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T03:59:01Z","timestamp":1438315141000},"page":"167-188","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalized minimum spanning tree games"],"prefix":"10.1016","volume":"4","author":[{"given":"PhuocHoang","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tri-Dung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tolga","family":"Bekta\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1007\/s13675-015-0042-y_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10479-012-1251-x","article-title":"An axiomatic approach in minimum cost spanning tree problems with groups","volume":"225","author":"Berganti\u00f1os","year":"2015","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","article-title":"On cost allocation for a spanning tree: a game theory approach","volume":"6","author":"Bird","year":"1976","journal-title":"Networks"},{"key":"10.1007\/s13675-015-0042-y_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.geb.2009.11.001","article-title":"Sharing a minimal cost spanning tree: beyond the Folk solution","volume":"69","author":"Bogomolnaia","year":"2010","journal-title":"Games Econ Behav"},{"year":"2011","series-title":"Computational aspects of cooperative game theory","author":"Chalkiadakis","key":"10.1007\/s13675-015-0042-y_CR4"},{"key":"10.1007\/s13675-015-0042-y_CR5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.3230030402","article-title":"Cost allocation for a spanning tree","volume":"3","author":"Claus","year":"1973","journal-title":"Networks"},{"key":"10.1007\/s13675-015-0042-y_CR6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","article-title":"Generalized spanning trees","volume":"120","author":"Dror","year":"2000","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.geb.2003.09.008","article-title":"Cost monotonicity, consistency and minimum cost spanning tree games","volume":"48","author":"Dutta","year":"2004","journal-title":"Games Econ Behav"},{"key":"10.1007\/s13675-015-0042-y_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01258278","article-title":"The Shapley value for cooperative games under precedence constraints","volume":"21","author":"Faigle","year":"1992","journal-title":"Int J Game Theor"},{"key":"10.1007\/s13675-015-0042-y_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263277","article-title":"On the complexity of testing membership in the core of min-cost spanning tree games","volume":"26","author":"Faigle","year":"1997","journal-title":"Int J Game Theor"},{"key":"10.1007\/s13675-015-0042-y_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.10009","article-title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","volume":"39","author":"Feremans","year":"2002","journal-title":"Networks"},{"key":"10.1007\/s13675-015-0042-y_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.ejor.2010.06.025","article-title":"Cooperative game theory and inventory management","volume":"210","author":"Fiestras-Janeiro","year":"2011","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR12","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.ejor.2010.01.015","article-title":"Cost allocation in collaborative forest transportation","volume":"205","author":"Frisk","year":"2010","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","article-title":"Minimum cost spanning tree games","volume":"21","author":"Granot","year":"1981","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0042-y_CR14","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/49.1956","article-title":"Tree structured fiber optics MAN\u2019s","volume":"6","author":"Gerla","year":"1988","journal-title":"IEEE J Sel Areas Commun"},{"key":"10.1007\/s13675-015-0042-y_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/ijoc.1040.0077","article-title":"Heuristic search for the generalized minimum spanning tree problem","volume":"17","author":"Golden","year":"2005","journal-title":"INFORMS J Comp"},{"key":"10.1007\/s13675-015-0042-y_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10479-012-1265-4","article-title":"The core of games on ordered structures and graphs","volume":"204","author":"Grabisch","year":"2013","journal-title":"Ann Oper Res"},{"year":"1978","series-title":"Fundamentals of computer algorithms","author":"Horowitz","key":"10.1007\/s13675-015-0042-y_CR17"},{"key":"10.1007\/s13675-015-0042-y_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0166-218X(98)00090-0","article-title":"Class steiner trees and VLSI-design","volume":"90","author":"Ihler","year":"1999","journal-title":"Discret Appl Math"},{"key":"10.1007\/s13675-015-0042-y_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning tree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc Am Math Soc"},{"year":"2013","series-title":"Game Theory","author":"Maschler","key":"10.1007\/s13675-015-0042-y_CR20"},{"key":"10.1007\/s13675-015-0042-y_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/moor.2.3.225","article-title":"Graphs and cooperation in games","volume":"2","author":"Myerson","year":"1977","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230260407","article-title":"On the generalized minimum spanning tree problem","volume":"26","author":"Myung","year":"1995","journal-title":"Networks"},{"key":"10.1007\/s13675-015-0042-y_CR23","first-page":"104","article-title":"A survey of different integer programming formulations of the generalized minimum spanning tree problem","volume":"25","author":"Pop","year":"2009","journal-title":"Carpathian J Math"},{"key":"10.1007\/s13675-015-0042-y_CR24","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst Tech J"},{"key":"10.1007\/s13675-015-0042-y_CR25","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/JSAC.1986.1146376","article-title":"Fiber optic regional area networks in New York and Dallas","volume":"4","author":"Prisco","year":"1986","journal-title":"IEEE J Sel Areas Commun"},{"key":"10.1007\/s13675-015-0042-y_CR26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ejor.2005.04.036","article-title":"Obligation rules for minimum cost spanning tree situations and their monotonicity properties","volume":"175","author":"Tijs","year":"2006","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-015-0042-y_CR27","unstructured":"Zverovich A (2002) GTSP instances. http:\/\/www.cs.rhul.ac.uk\/home\/zvero\/GTSPLIB\/"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-015-0042-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000605?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000605?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0042-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:06Z","timestamp":1761882366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S2192440621000605"],"URL":"https:\/\/doi.org\/10.1007\/s13675-015-0042-y","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2016,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized minimum spanning tree games","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-015-0042-y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}