{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T01:25:00Z","timestamp":1780968300292,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1007\/bf01580585","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:41:26Z","timestamp":1114681286000},"page":"212-222","source":"Crossref","is-referenced-by-count":100,"title":["A generalized linear production model: A unifying model"],"prefix":"10.1007","volume":"34","author":[{"given":"Daniel","family":"Granot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1090\/S0002-9904-1974-13478-6","volume":"80","author":"L.J. Billera","year":"1974","unstructured":"L.J. Billera and R.E. Bixby, \u201cMarket representation ofn-person games\u201c,Bulletin of the American Mathematical Society 80 (1974) 522\u2013526.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C. Bird","year":"1976","unstructured":"C. Bird, \u201cOn cost allocation for a spanning tree: A game theoretic approach\u201c,Networks 6 (1976) 335\u2013350.","journal-title":"Networks"},{"key":"CR3","first-page":"119","volume":"10","author":"O.N. Bondareva","year":"1963","unstructured":"O.N. Bondareva, \u201cSome applications of linear programming methods to the theory of cooperative games\u201c, (in Russian)Problemy Kibernetiki 10 (1963) 119\u2013139.","journal-title":"Problemy Kibernetiki"},{"key":"CR4","first-page":"32","volume":"9","author":"A. Charnes","year":"1967","unstructured":"A. Charnes and K.O. Kortanek, \u201cOn balanced sets, cores and linear programming\u201c,Cahiers du Centre d'Etudes de Recherches Op\u00e9rationnelles 9 (1967) 32\u201343.","journal-title":"Cahiers du Centre d'Etudes de Recherches Op\u00e9rationnelles"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02591996","volume":"29","author":"P. Dubey","year":"1984","unstructured":"P. Dubey and L.S. Shapley, \u201cTotally balanced games arising from controlled programming problems\u201c,Mathematical Programming 29 (1984) 245\u2013267.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0,1 vertices\u201c,National Bureau of Standards Journal of Research 69B (1965) 125\u2013130.","journal-title":"National Bureau of Standards Journal of Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cOptimum branchings\u201c,National Bureau of Standards Journal of Research 71B (1967) 233\u2013240.","journal-title":"National Bureau of Standards Journal of Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"D. Gale and L.S. Shapley, \u201cCollege admissions and the stability of marriage\u201c,American Mathematical Monthly 69 (1962) 9\u201314.","journal-title":"American Mathematical Monthly"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0110020","volume":"10","author":"R.E. Gomory","year":"1962","unstructured":"R.E. Gomory and T.C. Hu, \u201cAn application of generalized linear programming to network flows\u201c,Journal of the Society for Industrial and Applied Mathematics 10 (1962) 260\u2013283.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.30.5.633","volume":"30","author":"D. Granot","year":"1984","unstructured":"D. Granot, \u201cA note on the room-mates problem and a related revenue allocation problem\u201c,Management Science 30 (1984) 633\u2013643.","journal-title":"Management Science"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"D. Granot and G. Huberman, \u201cMinimum cost spanning tree games\u201c,Mathematical Programming 21 (1981) 1\u201318.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02592000","volume":"29","author":"D. Granot","year":"1984","unstructured":"D. Granot and G. Huberman, \u201cOn the core and nucleolus of minimum cost spanning tree games\u201c,Mathematical Programming 29 (1984) 323\u2013347.","journal-title":"Mathematical Programming"},{"key":"CR13","series-title":"Working Paper","volume-title":"On some network flow games","author":"D. Granot","year":"1984","unstructured":"D. Granot and F. Granot, \u201cOn some network flow games\u201d, Working Paper No. 1056, Faculty of Commerce and Business Administration, University of British Columbia, Vancouver (1984)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E. Kalai","year":"1982","unstructured":"E. Kalai and E. Zemel, \u201cGeneralized network problems yielding totally balanced games\u201c,Operations Research 30 (1982) 998\u20131008.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G. Owen","year":"1975","unstructured":"G. Owen, \u201cOn the core of linear production games\u201c,Mathematical Programming 9 (1975) 358\u2013370.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/nav.3800140404","volume":"4","author":"L.S. Shaplley","year":"1967","unstructured":"L.S. Shaplley, \u201cOn balanced sets and cores\u201c,Naval Research Logistics Quarterly 4 (1967) 453\u2013460.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"L.S. Shapley and M. Shubik, \u201cThe assignment game I: The core\u201c,International Journal of Game Theory 1 (1972) 111\u2013130.","journal-title":"International Journal of Game Theory"},{"key":"CR18","unstructured":"M.J. Todd, Private Communication, June 1985."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580585.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580585\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:09Z","timestamp":1556896329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["BF01580585"],"URL":"https:\/\/doi.org\/10.1007\/bf01580585","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}