<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Fonoberova, M.A.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Lozovanu, D.D.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>The maximum flow in dynamic networks</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2004</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier>
<subjects>
<subject>dynamic networks</subject>
<subject>network flow</subject>
<subject>dynamic flows</subject>
<subject>flows over time</subject>
<subject>maximum flows</subject>
</subjects>
<dates>
<date dateType='Issued'>2004-12-24</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='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. </description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>