Minimum cost flow with set-constraints (Q3936464)
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 3752565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost flow with set-constraints |
scientific article; zbMATH DE number 3752565 |
Statements
Minimum cost flow with set-constraints (English)
0 references
1982
0 references
minimum cost network flow
0 references
set-constraints
0 references
polymatroid intersection problem
0 references
algorithm
0 references
dual problem
0 references
supermodular functions
0 references
decomposition
0 references
submodular function
0 references
