The maximum flow in dynamic networks

Fonoberova Maria; Lozovanu Dmitrii

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

837

Ultima descărcare din IBN:
2023-05-14 04:46

SM ISO690:2012

FONOBEROVA, Maria, LOZOVANU, Dmitrii. The maximum flow in dynamic networks. In: Computer Science Journal of Moldova, 2004, nr. 3(36), pp. 387-396. ISSN 1561-4042.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Computer Science Journal of Moldova

Numărul 3(36) / 2004 / ISSN 1561-4042 /ISSNe 2587-4330

The maximum flow in dynamic networks

MSC 2010: 90B10, 90C35, 90C27

Pag. 387-396

Fonoberova Maria, Lozovanu Dmitrii

Institute of Mathematics and Computer Science ASM

Proiecte:

INTAS Optimisation of Tartaric acid and enonotanines extraction from winery wastes and their utilization for the synthesis of new compounds with biological activity and antioxidant properties

Disponibil în IBN: 4 iulie 2017

Descarcă PDF

Rezumat

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.

Cuvinte-cheie
dynamic networks, dynamic flows, maximum flows,

network flow, flows over time

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-52490</cfResPublId>
<cfResPublDate>2004-12-24</cfResPublDate>
<cfVol>36</cfVol>
<cfIssue>3</cfIssue>
<cfStartPage>387</cfStartPage>
<cfISSN>1561-4042</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/52490</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>The maximum flow in dynamic networks</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>dynamic networks; network flow; dynamic flows; flows over time; maximum flows</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>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. </cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-10522</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-129</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-10522</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-10522-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
<cfFamilyNames>Fonoberova</cfFamilyNames>
<cfFirstNames>Maria</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-129</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-129-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2004-12-24T24:00:00</cfStartDate>
<cfFamilyNames>Lozovanu</cfFamilyNames>
<cfFirstNames>Dmitrii</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>