Quickest Flow Algorithms with Time-Varying Attributes
Keywords:
Dynamic network, Optimization, Time-dependent, Quickest flow, Pseudo-polynomial algorithmAbstract
In many real-world situations, there are numerous network optimization problems where the network attributes depend on time. In this paper, we consider single-source single-sink discrete-time dynamic network flow problems. We review some algorithms for the quickest flow problems in two environments (to the network attributes): time-invariant and time-variant. This paper mainly focuses on the existing algorithms for a later one. In literature, most of the authors have made their objectives to determine the earliest arrival time paths along which a given amount of flow can be sent in the minimum time. Evacuation is the most recent research area of network optimization, where quickest flow models allow the estimation of the minimum time required to bring a given number of evacuees to safety.
Downloads
Published
How to Cite
Issue
Section
License
The copyright of the articles is held by the Institute of Science and Technology, Tribhuvan University (IoST- TU). The views and interpretations in this journal are those of the author(s). They are not attributable to the IoST-TU and do not imply the expression of any opinion concerning the legal status of any country, territory, city, area of its authorities, or concerning the delimitation of its frontiers or boundaries. The corresponding author is responsible for any conflict of interest between authors and others.
The articles in the Journal of Institute of Science and Technology are licensed under a Creative Commons Attribution- Share Alike 4.0 International License (CC: BY-NC), which permits use, distribution and reproduction in any medium or format, remix, transfer, and build upon the materials for any purpose, even commercially, provided the original work is properly cited.
