A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611)
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 strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks |
scientific article |
Statements
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (English)
0 references
30 August 1993
0 references
A strongly polynomial algorithm to find rational and integer flow vectors is presented that minimize a convex separable quadratic cost function on two-terminal series-parallel graphs.
0 references
strongly polynomial algorithm
0 references
convex separable quadratic cost function
0 references
two-terminal series-parallel graphs
0 references
0 references
