THE OPTIMAL FLOW IN DYNAMIC NETWORKSWITH NONLINEAR COST FUNCTIONS ON EDGES

Simple item page
dc.contributor.authorFonoberova, Maria
dc.contributor.authorLozovanu, Dmitrii
dc.date.accessioned2021-10-19T08:50:25Z
dc.date.available2021-10-19T08:50:25Z
dc.date.issued2004
dc.description.abstractIn this paper we study the dynamic version of the nonlinear minimum- cost flow problem on networks. We consider the problem on dynamic networks with nonlinear cost functions on edges that depend on time and flow. Moreover, we assume that the demand function and capacities of edges also depend on time. To solve the problem we propose an algorithm, which is based on reducing the dynamic problem to the classical minimum-cost problem on a time-expanded network. We also study some generalization of the proposed problem.en
dc.identifier.citationFONOBEROVA, Maria, LOZOVANU, Dmitrii. The optimal flow in dynamic networks with nonlinear cost functions on edges. In: Buletinul Academiei de Ştiinţe a Moldovei. Matematica. 2004, nr. 3(46), pp. 10-16. ISSN 1024-7696.en
dc.identifier.issn1024-7696
dc.identifier.urihttps://msuir.usm.md/handle/123456789/4940
dc.language.isoenen
dc.publisherInstitutul de Matematică şi Informatică al AŞMen
dc.subjectdynamic networksen
dc.subjectnetwork flowen
dc.subjectflows over timeen
dc.subjectminimum cost flowsen
dc.titleTHE OPTIMAL FLOW IN DYNAMIC NETWORKSWITH NONLINEAR COST FUNCTIONS ON EDGESen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
The optimal flow in dynamic networks with nonlinear cost functions.pdf
Size:
97.15 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

2. Articole