Minimum flow problem on network flows with time-varying bounds
In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…,T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techn...
Gespeichert in:
| Veröffentlicht in: | Applied mathematical modelling 2012-09, Vol.36 (9), p.4414-4421 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4421 |
|---|---|
| container_issue | 9 |
| container_start_page | 4414 |
| container_title | Applied mathematical modelling |
| container_volume | 36 |
| creator | Salehi Fathabadi, H. Khodayifar, S. Raayatpanah, M.A. |
| description | In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…,T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n2m). |
| doi_str_mv | 10.1016/j.apm.2011.11.067 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671291929</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0307904X11007554</els_id><sourcerecordid>1671291929</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-122f2bef2b52c01f3fedd6ded605770cdc0d7187f82f64240b67c9ffd3a459fd3</originalsourceid><addsrcrecordid>eNp9UE1LxDAQzUHB9eMHeOvRS-skbZMtgiCLX7DiRcFbaJOJZm2aNWl38d-bdT0LbxhmeG948wg5p1BQoPxyVbRrVzCgtEgALg7IDEoQeQPV2xE5jnEFAHWaZuT6yQ7WTS4zvd9m6-C7Hl3mh2zAcevD5-8-Zls7fmSjdZhv2vBth_es89Og4yk5NG0f8eyvn5DXu9uXxUO-fL5_XNwsc1WKcswpY4Z1mKpmCqgpDWrNNWoOtRCgtAIt6FyYOTO8YhV0XKjGGF22Vd2kdkIu9neTw68J4yidjQr7vh3QT1FSLihraMOaRKV7qgo-xoBGroN1ybWkIHf5yJVM-chdPjIh5ZM0V3sNph82FoOMyuKgUNuAapTa23_UP3FXcJ0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671291929</pqid></control><display><type>article</type><title>Minimum flow problem on network flows with time-varying bounds</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>ScienceDirect Journals (5 years ago - present)</source><creator>Salehi Fathabadi, H. ; Khodayifar, S. ; Raayatpanah, M.A.</creator><creatorcontrib>Salehi Fathabadi, H. ; Khodayifar, S. ; Raayatpanah, M.A.</creatorcontrib><description>In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…,T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n2m).</description><identifier>ISSN: 0307-904X</identifier><identifier>DOI: 10.1016/j.apm.2011.11.067</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Algorithms ; Computation ; Dynamic network flow ; Mathematical models ; Minimum flow ; Minimum flow problem ; Modelling ; Networks ; Reoptimization technique ; Running</subject><ispartof>Applied mathematical modelling, 2012-09, Vol.36 (9), p.4414-4421</ispartof><rights>2011 Elsevier Inc.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-122f2bef2b52c01f3fedd6ded605770cdc0d7187f82f64240b67c9ffd3a459fd3</citedby><cites>FETCH-LOGICAL-c373t-122f2bef2b52c01f3fedd6ded605770cdc0d7187f82f64240b67c9ffd3a459fd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.apm.2011.11.067$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Salehi Fathabadi, H.</creatorcontrib><creatorcontrib>Khodayifar, S.</creatorcontrib><creatorcontrib>Raayatpanah, M.A.</creatorcontrib><title>Minimum flow problem on network flows with time-varying bounds</title><title>Applied mathematical modelling</title><description>In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…,T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n2m).</description><subject>Algorithms</subject><subject>Computation</subject><subject>Dynamic network flow</subject><subject>Mathematical models</subject><subject>Minimum flow</subject><subject>Minimum flow problem</subject><subject>Modelling</subject><subject>Networks</subject><subject>Reoptimization technique</subject><subject>Running</subject><issn>0307-904X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LxDAQzUHB9eMHeOvRS-skbZMtgiCLX7DiRcFbaJOJZm2aNWl38d-bdT0LbxhmeG948wg5p1BQoPxyVbRrVzCgtEgALg7IDEoQeQPV2xE5jnEFAHWaZuT6yQ7WTS4zvd9m6-C7Hl3mh2zAcevD5-8-Zls7fmSjdZhv2vBth_es89Og4yk5NG0f8eyvn5DXu9uXxUO-fL5_XNwsc1WKcswpY4Z1mKpmCqgpDWrNNWoOtRCgtAIt6FyYOTO8YhV0XKjGGF22Vd2kdkIu9neTw68J4yidjQr7vh3QT1FSLihraMOaRKV7qgo-xoBGroN1ybWkIHf5yJVM-chdPjIh5ZM0V3sNph82FoOMyuKgUNuAapTa23_UP3FXcJ0</recordid><startdate>201209</startdate><enddate>201209</enddate><creator>Salehi Fathabadi, H.</creator><creator>Khodayifar, S.</creator><creator>Raayatpanah, M.A.</creator><general>Elsevier Inc</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201209</creationdate><title>Minimum flow problem on network flows with time-varying bounds</title><author>Salehi Fathabadi, H. ; Khodayifar, S. ; Raayatpanah, M.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-122f2bef2b52c01f3fedd6ded605770cdc0d7187f82f64240b67c9ffd3a459fd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Computation</topic><topic>Dynamic network flow</topic><topic>Mathematical models</topic><topic>Minimum flow</topic><topic>Minimum flow problem</topic><topic>Modelling</topic><topic>Networks</topic><topic>Reoptimization technique</topic><topic>Running</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Salehi Fathabadi, H.</creatorcontrib><creatorcontrib>Khodayifar, S.</creatorcontrib><creatorcontrib>Raayatpanah, M.A.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Applied mathematical modelling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Salehi Fathabadi, H.</au><au>Khodayifar, S.</au><au>Raayatpanah, M.A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimum flow problem on network flows with time-varying bounds</atitle><jtitle>Applied mathematical modelling</jtitle><date>2012-09</date><risdate>2012</risdate><volume>36</volume><issue>9</issue><spage>4414</spage><epage>4421</epage><pages>4414-4421</pages><issn>0307-904X</issn><abstract>In this paper, we consider the minimum flow problem on network flows in which the lower arc capacities vary with time. We will show that this problem for set {0,1,…,T} of time points can be solved by at most n minimum flow computations, by combining of preflow-pull algorithm and reoptimization techniques (no matter how many values of T are given). Running time of the presented algorithm is O(n2m).</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.apm.2011.11.067</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0307-904X |
| ispartof | Applied mathematical modelling, 2012-09, Vol.36 (9), p.4414-4421 |
| issn | 0307-904X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671291929 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithms Computation Dynamic network flow Mathematical models Minimum flow Minimum flow problem Modelling Networks Reoptimization technique Running |
| title | Minimum flow problem on network flows with time-varying bounds |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T05%3A36%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimum%20flow%20problem%20on%20network%20flows%20with%20time-varying%20bounds&rft.jtitle=Applied%20mathematical%20modelling&rft.au=Salehi%20Fathabadi,%20H.&rft.date=2012-09&rft.volume=36&rft.issue=9&rft.spage=4414&rft.epage=4421&rft.pages=4414-4421&rft.issn=0307-904X&rft_id=info:doi/10.1016/j.apm.2011.11.067&rft_dat=%3Cproquest_cross%3E1671291929%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671291929&rft_id=info:pmid/&rft_els_id=S0307904X11007554&rfr_iscdi=true |