{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T23:09:06Z","timestamp":1692745746917},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T00:00:00Z","timestamp":1364256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s11590-013-0634-5","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T05:44:43Z","timestamp":1364190283000},"page":"801-809","source":"Crossref","is-referenced-by-count":5,"title":["An algorithm to solve the proportional network flow problem"],"prefix":"10.1007","volume":"8","author":[{"given":"David R.","family":"Morrison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason J.","family":"Sauppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,26]]},"reference":[{"key":"634_CR1","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall, New Jersey (1993)"},{"issue":"10","key":"634_CR2","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1287\/mnsc.45.10.1440","volume":"45","author":"RK Ahuja","year":"1999","unstructured":"Ahuja, R.K., Orlin, J.B., Sechi, G.M., Zuddas, P.: Algorithms for the simple equal flow problem. Manag. Sci. 45(10), 1440\u20131455 (1999)","journal-title":"Manag. Sci."},{"issue":"1","key":"634_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0377-2217(88)90012-4","volume":"36","author":"AI Ali","year":"1988","unstructured":"Ali, A.I., Kennington, J., Shetty, B.: The equal flow problem. Eur. J. Oper. Res. 36(1), 107\u2013115 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"634_CR4","unstructured":"Bah\u00e7eci, U., Feyziog\u0303lu, O.: A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks. Opt. Lett. 6(6), 1173\u20131184 (2012)"},{"issue":"3","key":"634_CR5","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0377-2217(02)00505-2","volume":"150","author":"HI Calvete","year":"2003","unstructured":"Calvete, H.I.: Network simplex algorithm for the general equal flow problem. Eur. J. Oper. Res. 150(3), 585\u2013600 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"634_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/62038.62041","volume":"15","author":"MD Chang","year":"1989","unstructured":"Chang, M.D., Chen, C.-H.J., Engquist, M.: An improved primal simplex variant for pure processing networks. ACM Trans. Math. Softw. 15(1), 64\u201378 (1989)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"634_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0360-8352(94)00036-M","volume":"28","author":"JW Chinneck","year":"1995","unstructured":"Chinneck, J.W.: Processing network models of energy\/environment systems. Comput. Ind. Eng. 28(1), 179\u2013189 (1995)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"634_CR8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/0305-0483(95)00023-H","volume":"23","author":"JW Chinneck","year":"1995","unstructured":"Chinneck, J.W., Moll, R.H.H.: Processing network models for forest management. Omega 23(5), 499\u2013510 (1995)","journal-title":"Omega"},{"issue":"2","key":"634_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.4.2.132","volume":"4","author":"R Clark","year":"1992","unstructured":"Clark, R., Kennington, L., Meyer, R.R., Ramamurti, M.: Generalized networks: parallel algorithms and an empirical analysis. ORSA J. Comput. 4(2), 132\u2013145 (1992)","journal-title":"ORSA J. Comput."},{"key":"634_CR10","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., Stutz, J.: NETGEN: A program for generating large scale capacitated assignment, transportation and minimum cost flow networks. Manag. Sci. 20, 814\u2013820 (1974)","journal-title":"Manag. Sci."},{"key":"634_CR11","unstructured":"Koene, J.: Minimal cost flow in processing networks : a primal approach. Benders, JF (Promotor), Wessels, J (Promotor) Technical report (1982). http:\/\/alexandria.tue.nl\/extra1\/PRF4A\/8203150.pdf"},{"key":"634_CR12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.1110.0485","volume":"25","author":"DR Morrison","year":"2013","unstructured":"Morrison, D.R., Sauppe, J.J., Jacobson, S.H.: A network simplex algorithm for the equal flow problem on a generalized network. INFORMS J. Comput. 25, 2\u201312 (2013)","journal-title":"INFORMS J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0634-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0634-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0634-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:35Z","timestamp":1559409095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0634-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,26]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0634-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,26]]}}}