Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315)
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: Fast algorithms for convex cost flow problems on circles, lines, and trees |
scientific article; zbMATH DE number 6591797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for convex cost flow problems on circles, lines, and trees |
scientific article; zbMATH DE number 6591797 |
Statements
Fast algorithms for convex cost flow problems on circles, lines, and trees (English)
0 references
10 June 2016
0 references
network flow algorithms
0 references
convex cost flows
0 references
minimum cost flows
0 references
computational complexity
0 references
applications
0 references
0 references
0 references
0 references
