The budgeted minimum cost flow problem with unit upgrading cost (Q4565772)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The budgeted minimum cost flow problem with unit upgrading cost |
scientific article; zbMATH DE number 6887371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The budgeted minimum cost flow problem with unit upgrading cost |
scientific article; zbMATH DE number 6887371 |
Statements
The budgeted minimum cost flow problem with unit upgrading cost (English)
0 references
13 June 2018
0 references
minimum cost flow
0 references
bilinear problem
0 references
budgeted optimization
0 references
network optimization
0 references
complexity
0 references
series-parallel graphs
0 references
graphs of bounded treewidth
0 references
0.8288938403129578
0 references
0.828179121017456
0 references
0.8260303139686584
0 references
