Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730)
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 7343994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle |
scientific article; zbMATH DE number 7343994 |
Statements
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (English)
0 references
5 May 2021
0 references
minimum cost flow problem
0 references
(dynamic) multicommodity
0 references
combinatorial optimization
0 references
decomposition principle
0 references
0.8685250282287598
0 references
0.8626543283462524
0 references
0.8597794771194458
0 references
0.833748459815979
0 references
0.8259066343307495
0 references
