Minimum cost time-varying network flow problems (Q3562412)
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 5710534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost time-varying network flow problems |
scientific article; zbMATH DE number 5710534 |
Statements
Minimum cost time-varying network flow problems (English)
0 references
21 May 2010
0 references
network flows
0 references
time-varying networks
0 references
shortest dynamic path
0 references
minimum cost dynamic flow
0 references
0.9219970107078552
0 references
0.8825847506523132
0 references
0.878204882144928
0 references
0.8774272203445435
0 references
