Minimum cost flow with set-constraints (Q3936464): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230120102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010580694 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Revision as of 14:02, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost flow with set-constraints |
scientific article |
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
