Authors: Fonoberova Maria
, Lozovanu Dmitrii
Dynamic networks, network flow, dynamic flows, flows over time, maximum flows.
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.
– 0.15 Mb