Algorithms for finding optimal flows in dynamic networks (Q2974407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6702300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding optimal flows in dynamic networks |
scientific article; zbMATH DE number 6702300 |
Statements
Algorithms for Finding Optimal Flows in Dynamic Networks (English)
0 references
7 April 2017
0 references
dynamic networks
0 references
minimum cost flow problem
0 references
multicommodity flows
0 references
network flows
0 references
optimal flows
0 references
0 references
0 references
0.9043527245521544
0 references
0.8514394760131836
0 references
