Time-varying network optimization. (Q885899): Difference between revisions

Time-varying network optimization represents a very important research topic especially due to the many applications fields of it: transportation, telecommunications, computer networking, financial planning, logistics, energy distribution, etc. After an initial emphasis on static network optimization problems, some of the focus is now shifting towards dynamic (time-varying) variants of network optimization problems. The work done so far deals with static problems where all the data are known in advance, i.e. before the optimization has started. In their book the authors present several aspects of time-varying network problems including: mathematical models, polyhedral aspects, complexity, exact algorithms, approximation and heuristic algorithms, dynamic programming, etc. The problems that are described and examined in this book are: {\parindent=5mm \begin{itemize}\item[-] time-varying shortest paths problems; \item[-] time-varying minimum spanning trees; \item[-] time-varying universal maximum flow problems; \item[-] time-varying minimum cost flow problems; \item[-] time-varying maximum capacity path problems; \item[-] the quickest path problem; \item[-] finding the best path with multi-criteria; \item[-] generalized flows and other network problems. \end{itemize}} In the book are described the structure of the proposed algorithms for various time-varying network optimization problems. The authors developed as well the software that implements the algorithms, which is available for academic study purpose.