Efficient algorithms for the maximum concurrent flow problem (Q4642463)
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 6871469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the maximum concurrent flow problem |
scientific article; zbMATH DE number 6871469 |
Statements
Efficient algorithms for the maximum concurrent flow problem (English)
0 references
23 May 2018
0 references
maximum concurrent flow
0 references
column generation
0 references
decompositions
0 references
combinatorial algorithm
0 references
shortest path
0 references
sparsest cut
0 references
tree-based formulation
0 references
0.95887214
0 references
0 references
0 references
0.9093568
0 references
0.9060792
0 references
0.90306485
0 references
0.9020475
0 references
0 references
