Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926)
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: Implementation and test of auction methods for solving generalized network flow problems with separable convex cost |
scientific article; zbMATH DE number 1924986
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation and test of auction methods for solving generalized network flow problems with separable convex cost |
scientific article; zbMATH DE number 1924986 |
Statements
Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (English)
0 references
9 June 2003
0 references
Generalized network flow
0 references
\(\varepsilon\)-relaxation method
0 references
auction sequential shortest path algorithm
0 references
implementation
0 references
computation
0 references
0 references
0 references
0 references
