Time minimizing flows in directed networks (Q3321806)
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 3852763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time minimizing flows in directed networks |
scientific article; zbMATH DE number 3852763 |
Statements
Time minimizing flows in directed networks (English)
0 references
1982
0 references
directed networks
0 references
bottleneck assignment
0 references
time-minimizing transportation
0 references
arc capacity
0 references
maximal flow
0 references
solution algorithm
0 references
0.8553895354270935
0 references
0.846990704536438
0 references
0.8416546583175659
0 references
