The maximum flow in dynamic networks
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
811 7
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:
 
Disponibil în IBN: 4 iulie 2017


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