The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicom-modity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities , time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions,… (More)
The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon. The corresponding algorithm to solve this problem is proposed and some details concerning its complexity are discussed.
A graph G is called F-saturated if it is F-free but the addition of any missing edge to G creates a copy of F. Let the saturation function sat(n, F) be the minimum number of edges that an F-saturated graph on n vertices can have. We determine this function asymptotically for every fixed complete partite graph F as n tends to infinity and give some… (More)
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on… (More)
The game-theoretic formulation of the multiobjective multi-commodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Human adaptability involves interconnected biological and psychological control processes that determine how successful we are in meeting internal and environmental challenges. Heart rate variability (HRV), the variability in consecutive R-wave to R-wave intervals (RRI) of the electrocardiogram, captures synergy between the brain and cardiovascular control… (More)