SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791)

From MaRDI portal
scientific article
Language Label Description Also known as
English
SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
scientific article

    Statements

    SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2012
    0 references
    low rank factorization
    0 references
    unconstrained binary quadratic programming
    0 references
    max-cut
    0 references
    nonlinear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers