A hybrid algorithm for solving convex separable network flow problems (Q3706799)
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 hybrid algorithm for solving convex separable network flow problems |
scientific article; zbMATH DE number 3934730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid algorithm for solving convex separable network flow problems |
scientific article; zbMATH DE number 3934730 |
Statements
A hybrid algorithm for solving convex separable network flow problems (English)
0 references
1985
0 references
convex separable pure network flow
0 references
piecewise linearization
0 references
modified Newton approaches
0 references
hybrid algorithm
0 references
feasible direction method
0 references
0 references
0 references
0 references
0 references
0.92083657
0 references
0.91905904
0 references
0.91760427
0 references
0.91571367
0 references
0.9131709
0 references
0.9067932
0 references
0.9038214
0 references
0.89874756
0 references
