Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
The maximum flow in dynamic networks
Authors: Fonoberova Maria, Lozovanu Dmitrii
Keywords: Dynamic networks, network flow, dynamic flows, flows over time, maximum flows.
– 0.15 Mb
Keywords: Dynamic networks, network flow, dynamic flows, flows over time, maximum flows.
Abstract
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. Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.Institute of Mathematics and Computer Science,
5 Academiei str.
Chisinau, MD-2028, Moldova.
E-mail:
E-mail:
5 Academiei str.
Chisinau, MD-2028, Moldova.
E-mail:
E-mail:
Fulltext
– 0.15 Mb
Contents
- Communication Equivalence Classes in Networks
- An algorithm for solving a class of knapsack problems and its generalization
- On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium)
- On stability in game problems of finding Nash set
- The maximum flow in dynamic networks
- The multiobjective transportation fractional programming model
- A New Approach in Agent Path-Finding using State Mark Gradients
- A Case-Based Reasoning for Regulation of an Urban Transportation Network
- Experience of Macroeconomic Models Realization in Transition Economy
- About a family of C2 splines with one free generating function
- The comparative analysis of implementation practices of e-government services
- Electronic Services in Public Administration (e-government); Privacy and Freedom of Information. (review of study made for situation in Moldova)
