An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951)

From MaRDI portal
scientific article
In more languages
Configure
Language Label Description Also known as
English
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
scientific article

    Statements

    An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (English)
    12 November 2010
    DC programming
    DC algorithms (DCA)
    nonconvex quadratic programming
    exact penalty
    DC relaxation
    branch-and-bound (B\&B)
    semidefinite programming (SDP)
    binary quadratic programming (BQP)

    Identifiers