On the minimum cost multiple-source unsplittable flow problem (Q3004201)
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 5903065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum cost multiple-source unsplittable flow problem |
scientific article; zbMATH DE number 5903065 |
Statements
On the minimum cost multiple-source unsplittable flow problem (English)
0 references
1 June 2011
0 references
network flows
0 references
integer programming
0 references
superadditive functions
0 references
0 references
0 references
0.7973639369010925
0 references
0.7964969873428345
0 references
0.7964969873428345
0 references
0.7935386896133423
0 references
0.7782069444656372
0 references
