A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem |
scientific article |
Statements
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (English)
0 references
13 December 2004
0 references
