{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:08:30Z","timestamp":1649102910673},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T00:00:00Z","timestamp":1322784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10852-011-9169-x","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T11:51:36Z","timestamp":1322826696000},"page":"105-117","source":"Crossref","is-referenced-by-count":2,"title":["Determining the Optimal Flows in Zero-Time Dynamic Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Seyed Ahmad","family":"Hosseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fardin Dashty","family":"Saridarq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,2]]},"reference":[{"key":"9169_CR1","volume-title":"Network flows. Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, M., Orlin, J.: Network flows. Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, New Jersey (1993)"},{"key":"9169_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"JE Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"9169_CR3","unstructured":"Bazaraa, M., Jarvis, J., Sherali, H.: Linear programming and network flows. Wiley (1990)"},{"key":"9169_CR4","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G Dantzig","year":"1961","unstructured":"Dantzig, G., Wolfe P.: The decomposition algorithm for linear programs. Econometrical 29, 767\u2013778 (1961)","journal-title":"Econometrical"},{"key":"9169_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G Dantzig","year":"1960","unstructured":"Dantzig, G., Wolfe P., Decomposition principle for linear programs. Opns. Res. 8, 101\u2013111 (1960)","journal-title":"Opns. Res."},{"key":"9169_CR6","unstructured":"Fonoberova, M.: Optimal Flows in Dynamic Networks and Algorithm for their Finding. PhD Thesis, Moldova University (2007)"},{"key":"9169_CR7","unstructured":"Fonoberova, M., Lozovanu, D.: Optimal dynamic flows in networks and applications. The International Symposium \u201cThe Issues of Calculation Optimization\u201d. Communications. pp. 92\u2013293. Crimea, Ukraine (2007)"},{"key":"9169_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"9169_CR9","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)"},{"key":"9169_CR10","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. PhD Thesis, Cornell University (1995)"},{"key":"9169_CR11","doi-asserted-by":"crossref","first-page":"2136","DOI":"10.1016\/j.apm.2009.10.026","volume":"34","author":"H Fathabdi","year":"2010","unstructured":"Fathabdi, H., Hosseini, S.A.: Maximum flow problem on dynamic generative network flows with time-varying bounds. Appl. Math. Model. 34, 2136\u20132147 (2010)","journal-title":"Appl. Math. Model."},{"key":"9169_CR12","first-page":"39","volume":"5","author":"SA Hosseini","year":"2010","unstructured":"Hosseini, S.A., Fathabdi, H.: Minimum cost flow problem on dynamic multi generative networks. Alg. Oper. Res. 5, 39\u201348 (2010)","journal-title":"Alg. Oper. Res."},{"key":"9169_CR13","doi-asserted-by":"crossref","first-page":"5017","DOI":"10.1016\/j.apm.2011.04.009","volume":"35","author":"SA Hosseini","year":"2011","unstructured":"Hosseini, A.: An introduction to dynamic generative networks: minimum cost flow. Appl. Math. Model. 35, 5017\u20135025 (2011)","journal-title":"Appl. Math. Model."},{"key":"9169_CR14","unstructured":"Hosseini, S.A.: The Minimum Cost Flow Problem in Dynamic Multi Generative Network Flows, DM10 Abstracts, The SIAM Conference on Discrete Mathematics, Hyatt Regency Austin, USA 44 (2010)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9169-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-011-9169-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9169-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:32Z","timestamp":1559255192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-011-9169-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9169"],"URL":"https:\/\/doi.org\/10.1007\/s10852-011-9169-x","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,2]]}}}