About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017)

From MaRDI portal
scientific article
Language Label Description Also known as
English
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
scientific article

    Statements

    About strongly polynomial time algorithms for quadratic optimization over submodular constraints (English)
    0 references
    0 references
    0 references
    10 April 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Kuhn-Tucker conditions
    0 references
    lexicographically optimal flow
    0 references
    parametric maximum flow
    0 references
    strongly polynomial algorithms
    0 references
    convex separable quadratic minimization over submodular constraints
    0 references