{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T09:03:04Z","timestamp":1772614984584,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00714-2","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T21:26:05Z","timestamp":1044393965000},"page":"84-97","source":"Crossref","is-referenced-by-count":74,"title":["Minimum cost spanning tree games and population monotonic allocation schemes"],"prefix":"10.1016","volume":"154","author":[{"given":"Henk","family":"Norde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Moretti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stef","family":"Tijs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00714-2_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","article-title":"On cost allocation for a spanning tree: A game theoretic approach","volume":"6","author":"Bird","year":"1976","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB2","unstructured":"Gillies, D.B., 1953. Some theorems on n-person games, Ph.D. Dissertation, Princeton University Press, Princeton, New Yersey"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","article-title":"On minimum cost spanning tree games","volume":"21","author":"Granot","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB4","unstructured":"Kent, K.J., Skorin-Kapov, D., 1996. Population monotonic cost allocations on MSTs, Discussion Paper, State University of New York at Stony Brook"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB5","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B., 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society 7, pp. 48\u201350","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230080104","article-title":"Cost allocation for Steiner trees","volume":"8","author":"Megiddo","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB7","unstructured":"Moretti, S., Norde, H., Pham Do, K.H., Tijs, S., 2001. Connection problems in mountains and monotonic allocation schemes, CentER Discussion Paper 2001-12, Tilburg University"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB8","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 Systems Technical Journal"},{"key":"10.1016\/S0377-2217(02)00714-2_BIB9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0899-8256(90)90006-G","article-title":"Population monotonic allocation schemes for cooperative games with transferable utility","volume":"2","author":"Sprumont","year":"1990","journal-title":"Games and Economic Behavior"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:30:17Z","timestamp":1553913017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221702007142"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00714-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}