A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860)
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: A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem |
scientific article; zbMATH DE number 2121786
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem |
scientific article; zbMATH DE number 2121786 |
Statements
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (English)
0 references
13 December 2004
0 references
