{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T02:55:38Z","timestamp":1765421738581},"reference-count":13,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6523,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A single\u2010source single\u2010sink dynamic network is considered where the link flows are real\u2010valued measurable functions defined on a time interval and where storage is allowed at the nodes. Piecewise\u2010constant link and storage capacities are given. A \u03c4\u2010maximum flow is a dynamic flow assignment that maximizes the total amount of commodity reaching the sink before time \u03c4. The problem considered is that of computing a flow which is simultaneously \u03c4\u2010maximum for all \u03c4. Such a flow solves a minimum\u2010delay dynamic routing problem. An algorithm is presented which computes an optimal flow in <jats:italic>O<\/jats:italic>( | <jats:italic>N<\/jats:italic> | <jats:sup>4<\/jats:sup>T<jats:sup>4<\/jats:sup>) time, where | <jats:italic>N<\/jats:italic> | is the number of nodes and <jats:italic>T<\/jats:italic> is the number of times that the capacities change. Previous polynomial\u2010time algorithms have been given only for the case of constant capacities.<\/jats:p>","DOI":"10.1002\/net.3230180405","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T01:49:39Z","timestamp":1178934579000},"page":"303-318","source":"Crossref","is-referenced-by-count":26,"title":["Minimum\u2010delay routing in continuous\u2010time dynamic networks with Piecewise\u2010constant capacities"],"prefix":"10.1002","volume":"18","author":[{"given":"Richard G.","family":"Ogier","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.4.501"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140308"},{"key":"e_1_2_1_5_2","unstructured":"M.JodorkovskyandA.Segall A maximal flow approach to dynamic routing in communication networks. EE Publ. 358 Technion\u2010Israel Institute of Technology Aug.1979."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90016-9"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.517"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"F. H.Moss The application of optimal control theory to dynamic routing in communication networks. Ph.D. Dissertation Massachusetts Institute of Technology Cambridge; Electr. Syst. Lab. Rept. ESL\u2010R\u2010721 February1977.","DOI":"10.21236\/ADA041241"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102915"},{"key":"e_1_2_1_10_2","first-page":"565","volume-title":"Proceedings 1983 Conferences on Information Sciences and Systems","author":"Ogier R. G.","year":"1983"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial Optimization\u2014Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093715"},{"key":"e_1_2_1_13_2","unstructured":"S.ShatsandA.Segall Open\u2010loop solutions for the dynamic routine problem. Report LIDS\u2010R\u2010922 Laboratory for Information and Decision Systems Massachusetts Institute of Technology (1980)."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096380"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T01:22:20Z","timestamp":1697937740000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["10.1002\/net.3230180405"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180405","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}