A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost (Q5260182)
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 6453585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost |
scientific article; zbMATH DE number 6453585 |
Statements
29 June 2015
0 references
multicommodity flow
0 references
traffic network
0 references
minimum-cost flow
0 references
composite parameters
0 references
composite indicators
0 references
successive shortest path algorithm
0 references
Ford-Fulkerson algorithm
0 references
0.8239916563034058
0 references
0.807662844657898
0 references
0.8041778802871704
0 references
