{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:48:07Z","timestamp":1757544487620},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01583798","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:31:20Z","timestamp":1114662680000},"page":"341-348","source":"Crossref","is-referenced-by-count":18,"title":["Optimal sharing"],"prefix":"10.1007","volume":"23","author":[{"given":"Tetsuo","family":"Ichimori","sequence":"first","affiliation":[]},{"given":"Hiroaki","family":"Ishii","sequence":"additional","affiliation":[]},{"given":"Toshio","family":"Nishida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.27.2.324","volume":"27","author":"J.R. Brown","year":"1979","unstructured":"J.R. Brown, \u201cThe sharing problem\u201d,Operations Research 27 (1979) 324\u2013340.","journal-title":"Operations Research"},{"key":"CR2","volume-title":"Graph theory: an algorithmic approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides,Graph theory: an algorithmic approach (Academic Press, New York, NY, 1975)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S. Fujishige","year":"1980","unstructured":"S. Fujishige, \u201cLexicographically optimal base of polymatroid with respect to a weight vector\u201d,Mathematics of Operations Research 5 (1980) 186\u2013196.","journal-title":"Mathematics of Operations Research"},{"key":"CR4","first-page":"13","volume":"11","author":"Z. Galil","year":"1979","unstructured":"Z. Galil and A. Naamad, \u201cNetwork flows and generalized path compression\u201d,Proceedings of ACM Symposia on the Theory of Computing 11 (1979) 13\u201326.","journal-title":"Proceedings of ACM Symposia on the Theory of Computing"},{"key":"CR5","first-page":"65","volume":"24","author":"T. Ichimori","year":"1979","unstructured":"T. Ichimori, H. Ishii and T. Nishida, \u201cA minimax flow problem\u201d,Mathematica Japonica 24 (1979) 65\u201371.","journal-title":"Mathematica Japonica"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.15807\/jorsj.23.268","volume":"23","author":"T. Ichimori","year":"1980","unstructured":"T. Ichimori, H. Ishii and T. Nishida, \u201cFinding the weighted minimax flow in polynomial time\u201d,Journal of the Operations Research Society of Japan 23 (1980) 268\u2013272.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1111\/j.1749-6632.1979.tb32805.x","volume":"319","author":"M. Iri","year":"1979","unstructured":"M. Iri, \u201cA review of recent work in Japan on principal partitions of matroids and their applications\u201d,Annals of the New York Academy of Sciences 319 (1979) 306\u2013319.","journal-title":"Annals of the New York Academy of Sciences"},{"key":"CR8","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"A.V. Karzanov, \u201cDetermining the maximum flow in a network by the method of preflows\u201d,Soviet Mathematics Doklady 15 (1974) 434\u2013437.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR9","volume-title":"Combinatorial optimization: networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial optimization: networks and matroids (Holt, Rinehart and Winston, New York, NY 1976)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N. Megiddo","year":"1974","unstructured":"N. Megiddo, \u201cOptimal flows in networks with multiple sources and sinks\u201d,Mathematical Programming 7 (1974) 97\u2013107.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1090\/S0002-9904-1977-14298-5","volume":"83","author":"M. Megiddo","year":"1977","unstructured":"M. Megiddo, \u201cA good algorithm for lexicographically optimal flows in multi-terminal networks\u201d,Bulletin of the American Mathematical Society 83 (1977) 407\u2013409.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230090405","volume":"9","author":"D.F. Stanat","year":"1979","unstructured":"D.F. Stanat and G.A. Mag\u00f3, \u201cMinimizing maximum flows in linear graphs\u201d,Networks 9 (1979) 333\u2013361.","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583798.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01583798\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:29:24Z","timestamp":1556882964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01583798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01583798"],"URL":"https:\/\/doi.org\/10.1007\/bf01583798","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}