<?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>
</creators>
<titles>
<title xml:lang='en'>On determining the minimum cost flows in dynamic networks</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2006</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>dynamic networks</subject>
<subject>dynamic flows</subject>
<subject>minimum cost flows.</subject>
</subjects>
<dates>
<date dateType='Issued'>2006-04-30</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>The dynamic minimum cost flow problem that generalizes the static one is studied. We assume that the supply and demand function and capacities of edges depend on time. One very important case of the minimum cost flow problem with nonlinear cost functions, defined on edges, that do not depend on flow but depend on time is studied. </description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>