Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (Q3503231)

From MaRDI portal
Revision as of 21:31, 11 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126246767, #quickstatements; #temporary_batch_1718133921243)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
scientific article

    Statements

    Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    jump system
    0 references
    discrete convex function
    0 references
    bisubmodular function
    0 references
    bisubmodular polyhedron
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references