<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Fonoberova, M.A.</dc:creator>
<dc:creator>Lozovanu, D.D.</dc:creator>
<dc:date>2004-12-24</dc:date>
<dc:description xml:lang='en'>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. </dc:description>
<dc:source>Computer Science Journal of Moldova 36 (3) 387-396</dc:source>
<dc:subject>dynamic networks</dc:subject>
<dc:subject>network flow</dc:subject>
<dc:subject>dynamic flows</dc:subject>
<dc:subject>flows over time</dc:subject>
<dc:subject>maximum flows</dc:subject>
<dc:title>The maximum flow in dynamic networks</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>