An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757)

From MaRDI portal
Revision as of 15:55, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
scientific article

    Statements

    An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (English)
    0 references
    0 references
    19 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    graph method decomposition
    0 references
    network
    0 references
    numerical examples
    0 references
    graph method decomposition technique
    0 references
    algorithm
    0 references
    nonlinear multi-commodity network flow problems
    0 references
    modified successive projection and truncated technique
    0 references
    successive quadratic programming method
    0 references
    dual projected pseudo-quasi-Newton method
    0 references
    0 references