{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T07:12:09Z","timestamp":1661584329120},"reference-count":21,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":191,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2018,2,20]]},"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>The paper presents a dynamic solution method for the parametric minimum flow in time-dependent, dynamic network. This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instead of directly working in the original network, the method implements a labelling algorithm which works in the parametric dynamic residual network where repeatedly decreases the flow along quickest dynamic source-sink paths for different subintervals of parameter values, in their increasing order. In each iteration, the algorithm computes both the parametric minimum flow within a certain subinterval, and the new subinterval for which the flow needs to be computed.<\/jats:p>","DOI":"10.1051\/ita\/2018002","type":"journal-article","created":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T11:50:22Z","timestamp":1531309822000},"page":"43-53","source":"Crossref","is-referenced-by-count":0,"title":["Minimum parametric flow in time-dependent dynamic networks"],"prefix":"10.1051","volume":"52","author":[{"given":"Mircea","family":"Parpalea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicoleta","family":"Avesalon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleonor","family":"Ciurea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"R1","unstructured":"Ahuja R., Magnanti T. and Orlin J., Network Flows: Theory, Algorithms and Applications. Prentice Hall Inc., Englewood Cliffs, NJ (1993)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"Aronson","year":"1989","journal-title":"Ann. Oper. Res."},{"key":"R3","first-page":"188","volume":"43","author":"Avesalon (Grigora\u015f)","year":"2016","journal-title":"Ann. Univ. Craiova \u2013 Math. Comput. Sci. Ser."},{"key":"R4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-2017-1600","volume":"156","author":"Avesalon (Grigora\u015f)","year":"2017","journal-title":"Fundam. Inform."},{"key":"R5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s12469-010-0018-5","volume":"1","author":"Bunte","year":"2009","journal-title":"Public Transp."},{"key":"R6","unstructured":"Cai X., Sha D. and Wong C.K., Time-Varying Network Optimization. Springer (2007)."},{"key":"R7","first-page":"115","volume":"32","author":"Fathabadi","year":"2015","journal-title":"J. Ind. Prod. Eng."},{"key":"R8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01415514","volume":"33","author":"Hamacher","year":"1989","journal-title":"ZOR-Methods Model. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.trc.2015.05.005","volume":"59","author":"He","year":"2015","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"R10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/B:JMMA.0000026708.57419.6d","volume":"3","author":"Miller-Hooks","year":"2004","journal-title":"J. Math. Model. Algorithms"},{"key":"R11","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/10556780903239121","volume":"25","author":"Nasrabadi","year":"2010","journal-title":"Optim. Methods Softw"},{"key":"R12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.3141\/2459-10","volume":"2459","author":"Nassir","year":"2014","journal-title":"Transp. Res. Rec.: J. Transp. Res. Board"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Orlin J.B., Max flows in O(nm) time, or better, in Proc. of the Forty-Fifth Annual ACM Symposium on Theory of Computing, Palo Alto, California. ACM Press, New York (2013) 765\u2013774.","DOI":"10.1145\/2488608.2488705"},{"key":"R14","first-page":"191","volume":"3","author":"Parpalea","year":"2010","journal-title":"Bull. Transilv. Univ. of Bra\u015fov. Ser. III: Math. Inf. Phys."},{"key":"R15","first-page":"266","volume":"3","author":"Parpalea","year":"2011","journal-title":"Int. J. Appl. Math. Inform."},{"key":"R16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.4236\/am.2013.410A1002","volume":"4","author":"Parpalea","year":"2013","journal-title":"Appl. Math."},{"key":"R17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9734\/BJAST\/2016\/22636","volume":"13","author":"Parpalea","year":"2016","journal-title":"Br. J. Appl. Sci. Technol."},{"key":"R18","unstructured":"Rashidi H. and Tsang E., Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, 2nd edn. CRC Press (2015) 85\u2013104."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Ruhe G., Algorithmic Aspects of Flows in Networks, edited by Hazewinkel M.. Vol. 69 of Mathematics and its Applications. Kluwer Academic Publishers, Springer-Verlag, Dordrecht (1991).","DOI":"10.1007\/978-94-011-3444-6"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Skutella M., An introduction to network flows over time, in Research Trends in Combinatorial Optimization, edited by Cook W., Lov\u00e0sz L. and Vygen J.. Springer-Verlag, Berlin, Heidelberg (2009) 451\u2013482.","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"R21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/trsc.2013.0485","volume":"49","author":"Zheng","year":"2015","journal-title":"Transp. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2018002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T06:36:46Z","timestamp":1661582206000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2018002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":21,"journal-issue":{"issue":"1"},"alternative-id":["ita170072"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2018002","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}