Implementing an “exact” Newton method for separable convex transportation problems (Q3827809)
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: Implementing an “exact” Newton method for separable convex transportation problems |
scientific article; zbMATH DE number 4102836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementing an “exact” Newton method for separable convex transportation problems |
scientific article; zbMATH DE number 4102836 |
Statements
Implementing an “exact” Newton method for separable convex transportation problems (English)
0 references
1989
0 references
Newton method
0 references
minimum cost flow
0 references
transportation network
0 references
Lagrange multipliers
0 references
Choleski type factorization
0 references
Karmarkar's algorithm
0 references
0 references
0 references
0.8537880778312683
0 references
0.79203861951828
0 references
0.7729060053825378
0 references
0.7695404291152954
0 references
0.7611591815948486
0 references
