{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:15:05Z","timestamp":1778836505445,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T00:00:00Z","timestamp":1349913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10957-012-0183-6","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T08:09:23Z","timestamp":1349942963000},"page":"486-512","source":"Crossref","is-referenced-by-count":7,"title":["A Model-Based Approach and Analysis for Multi-Period Networks"],"prefix":"10.1007","volume":"157","author":[{"given":"Seyed Ahmad","family":"Hosseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,11]]},"reference":[{"key":"183_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, M., Orlin, J.: Network Flows. Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"183_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. 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":"183_CR3","volume-title":"Time-Varying Network Optimization","author":"X. Cal","year":"2007","unstructured":"Cal, X., Sha, D., Wong, C.K.: Time-Varying Network Optimization. Springer, Berlin (2007)"},{"key":"183_CR4","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University (1995)"},{"key":"183_CR5","volume-title":"Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures","author":"D. Lozovanu","year":"2010","unstructured":"Lozovanu, D.: Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures. Springer, Berlin (2010)"},{"key":"183_CR6","volume-title":"The Structure and Dynamics of Networks","author":"M. Newman","year":"2006","unstructured":"Newman, M., Barab\u00e1si, A., Watts, D.: The Structure and Dynamics of Networks. Princeton University Press, Princeton (2006)"},{"key":"183_CR7","first-page":"253","volume-title":"Proceedings of the Second Conference on the Foundations of Computer Aided Operations","author":"C. Pantelides","year":"1994","unstructured":"Pantelides, C.: Unified frameworks for the optimal process planning and scheduling. In: Proceedings of the Second Conference on the Foundations of Computer Aided Operations, p. 253. Cache, New York (1994)"},{"key":"183_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ejor.2011.06.021","volume":"215","author":"H. Stefansson","year":"2011","unstructured":"Stefansson, H., Sigmarsdottir, S., Jensson, P., Shah, N.: Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry. Eur. J. Oper. Res. 215, 383\u2013392 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"183_CR9","volume-title":"A Study on the Dynamic Network Flow Problems: With Applications to the Dynamic Resource Management in Logistics Networks","author":"H. Song","year":"2009","unstructured":"Song, H.: A Study on the Dynamic Network Flow Problems: With Applications to the Dynamic Resource Management in Logistics Networks. VDM, Saarbr\u00fccken (2009)"},{"key":"183_CR10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. 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":"183_CR11","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"183_CR12","volume-title":"DM 10 Abstracts, the SIAM Conference on Discrete Mathematics","author":"S.A. Hosseini","year":"2010","unstructured":"Hosseini, S.A.: The minimum cost flow problem in dynamic multi-generative network flows. In: DM 10 Abstracts, the SIAM Conference on Discrete Mathematics. Hyatt Regency, Austin (2010)"},{"key":"183_CR13","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.compchemeng.2010.07.007","volume":"35","author":"S. Mouret","year":"2011","unstructured":"Mouret, S., Grossmann, I.E., Pestiaux, P.: Time representations and mathematical models for process scheduling problems. Comput. Chem. Eng. 35, 1038\u20131063 (2011)","journal-title":"Comput. Chem. Eng."},{"key":"183_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0098-1354(93)80015-F","volume":"2","author":"E. Kondili","year":"1993","unstructured":"Kondili, E., Pantelides, C., Sargent, W.: A general algorithm for short-term scheduling of batch operations\u2014I. MILP formulation. Comput. Chem. Eng. 2, 211\u2013227 (1993)","journal-title":"Comput. Chem. Eng."},{"key":"183_CR15","doi-asserted-by":"crossref","first-page":"2913","DOI":"10.1016\/j.compchemeng.2011.01.004","volume":"35","author":"S. Terrazas","year":"2011","unstructured":"Terrazas, S., Trotter, P., Grossmann, I.E.: Temporal and spatial Lagrangian decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers. Comput. Chem. Eng. 35, 2913\u20132928 (2011)","journal-title":"Comput. Chem. Eng."},{"key":"183_CR16","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1021\/ie020923y","volume":"42","author":"C.T. Maravelias","year":"2003","unstructured":"Maravelias, C.T., Grossmann, I.E.: New continuous-time state task network formulation for the scheduling of multipurpose batch plants. Ind. Eng. Chem. Res. 42, 3056\u20133074 (2003)","journal-title":"Ind. Eng. Chem. Res."},{"key":"183_CR17","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.ijpe.2010.06.012","volume":"133","author":"N.H. Moin","year":"2011","unstructured":"Moin, N.H., Salhi, S., Aziz, N.A.B.: An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133, 334\u2013343 (2011)","journal-title":"Int. J. Prod. Econ."},{"key":"183_CR18","volume-title":"Introduction to Real Analysis","author":"R.G. Bartle","year":"2011","unstructured":"Bartle, R.G., Sherbert, D.R.: Introduction to Real Analysis. Wiley, New York (2011)"},{"key":"183_CR19","volume-title":"Foundations of Mathematical Analysis","author":"R. Johnsonbaugh","year":"2010","unstructured":"Johnsonbaugh, R., Pfaffenberger, W.E.: Foundations of Mathematical Analysis. Dover, New York (2010)"},{"key":"183_CR20","volume-title":"Real Analysis","author":"H. Royden","year":"2010","unstructured":"Royden, H., Fitzpatrick, P.: Real Analysis. Prentice Hall, New York (2010)"},{"key":"183_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9780471703778","volume-title":"Linear Programming and Network Flows","author":"M. Bazaraa","year":"2009","unstructured":"Bazaraa, M., Jarvis, J., Sherali, H.: Linear Programming and Network Flows. Wiley, New York (2009)"},{"key":"183_CR22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592950","volume":"39","author":"P.L. Jackson","year":"1987","unstructured":"Jackson, P.L., Lynch, D.F.: Revised Dantzig\u2013Wolfe decomposition for staircase-structured linear programs. Math. Program. 39, 157\u2013179 (1987)","journal-title":"Math. Program."},{"key":"183_CR23","unstructured":"Tebboth, J.: A computational study of Dantzig\u2013Wolfe decomposition. Ph.D. thesis, University of Buckingham (2001)"},{"key":"183_CR24","first-page":"35","volume":"80","author":"M.C. Ferris","year":"1998","unstructured":"Ferris, M.C., Horn, J.D.: Partitioning mathematical programs for parallel solution. Math. Program. 80, 35\u201361 (1998)","journal-title":"Math. Program."},{"key":"183_CR25","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1080\/1055678021000034341","volume":"17","author":"M.C. Ferris","year":"2002","unstructured":"Ferris, M.C., Voelker, M.M.: Slice models in general purpose modelling systems: an application to DEA. Optim. Methods Softw. 17, 1009\u20131032 (2002)","journal-title":"Optim. Methods Softw."},{"key":"183_CR26","unstructured":"Voelker, M.M.: Optimization of slice models. Ph.D. thesis, University of Wisconsin, Madison (2002)"},{"issue":"23","key":"183_CR27","doi-asserted-by":"crossref","first-page":"18024","DOI":"10.1021\/la103700g","volume":"26","author":"B.P. Binks","year":"2010","unstructured":"Binks, B.P., Fletcher, P., Holt, B.: Selective retardation of perfume oil evaporation from oil-in-water emulsions stabilized by either surfactant or nanoparticles. Langmuir 26(23), 18024\u201318030 (2010)","journal-title":"Langmuir"},{"key":"183_CR28","volume-title":"Handbook of Natural Gas Transmission and Processing","author":"S. Mokhatab","year":"2012","unstructured":"Mokhatab, S., Poe, W.: Handbook of Natural Gas Transmission and Processing. Gulf Pub., Houston (2012)"},{"key":"183_CR29","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. Econometrica 29, 767\u2013778 (1961)","journal-title":"Econometrica"},{"key":"183_CR30","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. Oper. Res. 8, 101\u2013111 (1960)","journal-title":"Oper. Res."},{"key":"183_CR31","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R. Borndorfe","year":"1998","unstructured":"Borndorfe, R., Ferreira, C.E., Martin, A.: Decomposing matrices into blocks. SIAM J. Optim. 9, 236\u2013269 (1998)","journal-title":"SIAM J. Optim."},{"key":"183_CR32","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 291\u2013307 (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"183_CR33","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.18.1.98","volume":"18","author":"R.L. Weil","year":"1971","unstructured":"Weil, R.L., Kettler, P.C.: Rearranging matrices to block-angular form for decomposition (and other) algorithms. Manag. Sci. 18, 98\u2013108 (1971)","journal-title":"Manag. Sci."},{"key":"183_CR34","doi-asserted-by":"crossref","first-page":"5017","DOI":"10.1016\/j.apm.2011.04.009","volume":"35","author":"A. 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."},{"issue":"5","key":"183_CR35","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., Napie, A., Stutzu, J.: NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problem. Manag. Sci. 20(5), 814\u2013821 (1974)","journal-title":"Manag. Sci."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0183-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0183-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0183-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:19Z","timestamp":1559469319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0183-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,11]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0183-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,11]]}}}