Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951)

From MaRDI portal
Revision as of 15:37, 7 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
Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
scientific article

    Statements

    Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (English)
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Variational inequalities
    0 references
    Co-coercivity
    0 references
    Traffic assignment
    0 references
    0 references
    0 references