Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (Q3813579): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:06, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems |
scientific article |
Statements
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (English)
0 references
1988
0 references
minimum cost flow problem
0 references
networks with gains
0 references
relaxation of the flow conservation equations
0 references
ascent method
0 references
