Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1123 5 |
Ultima descărcare din IBN: 2022-08-29 10:16 |
SM ISO690:2012 FONOBEROVA, Maria, LOZOVANU, Dmitrii. Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2007, nr. 1(53), pp. 107-119. ISSN 1024-7696. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | ||||||
Numărul 1(53) / 2007 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
Pag. 107-119 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
We consider the minimum cost multicommodity flow problem in dynamic
networks with time-varying capacities of arcs and transit times on arcs that depend on
the sort of commodity entering them. We assume that cost functions, defined on arcs,
are nonlinear and depend on time and flow, and the demand function also depends on
time. Moreover, we study the problem in the case when transit time functions depend
on time and flow. The modification of the time-expanded network method and new
algorithms for solving the considered classes of problems are proposed. |
||||||
Cuvinte-cheie Network flows, dynamic minimum cost flow problem., dynamic networks, multicommodity flows |
||||||
|