A polynomial algorithm for minimum quadratic cost flow problems (Q761341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3885618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for minimum quadratic cost flow problems |
scientific article; zbMATH DE number 3885618 |
Statements
A polynomial algorithm for minimum quadratic cost flow problems (English)
0 references
1984
0 references
Network flow problems with quaratic separable costs appear in a number of important applications such as approximating input-output matrices in economy, projecting and forecasting traffic matrices in telecommunication networks, or solving nondifferentiable cost flow problems by subgradient algorithms. Extending a scaling technique, used in the case of linear cost flows, to quadratic cost flows, a polynomial algorithm for this class of problems is given.
0 references
quaratic separable costs
0 references
scaling technique
0 references
polynomial algorithm
0 references
0 references
0.8555432558059692
0 references
0.8293917179107666
0 references
0.8288856744766235
0 references
0.8190143704414368
0 references
0.8167111277580261
0 references
