Open AccessOptimum Flows in Directed Bipartite Dynamic Network. The Static Approach
Author(s) -
Camelia Schiopu,
Eleonor Ciurea
Publication year - 2020
Publication title -
international journal of circuits, systems and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.156
H-Index - 13
ISSN - 1998-4464
DOI - 10.46300/9106.2020.14.43
Subject(s) - bipartite graph , mathematical optimization , computer science , extension (predicate logic) , maximum flow problem , variable (mathematics) , flow network , flow (mathematics) , dynamic network analysis , mathematics , theoretical computer science , graph , mathematical analysis , computer network , geometry , programming language
The theory of flows is one of the most important parts of Combinatorial Optimization and it has various applications. In this paper we study optimum (maximum or minimum) flows in directed bipartite dynamic network and is an extension of article [9]. In practical situations, it is easy to see many time-varying optimum problems. In these instances, to account properly for the evolution of the underlying system overtime, we need to use dynamic network flow models. When the time is considered as a variable discrete values, these problems can be solved by constructing an equivalent, static time expanded network. This is a static approach.