Implementing an “exact” Newton method for separable convex transportation problems (Q3827809): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.3230190108 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024983129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a block successive over-relaxation method for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scaled reduced gradient algorithm for network flow problems with convex separable costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipoint methods for separable nonlinear networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Kruithof's Projection Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for minimum quadratic cost flow problems / rank
 
Normal rank

Latest revision as of 14:31, 19 June 2024

scientific article
Language Label Description Also known as
English
Implementing an “exact” Newton method for separable convex transportation problems
scientific article

    Statements

    Implementing an “exact” Newton method for separable convex transportation problems (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references