A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134)

From MaRDI portal
Revision as of 14:49, 15 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q489091)
scientific article; zbMATH DE number 6865939
Language Label Description Also known as
English
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
scientific article; zbMATH DE number 6865939

    Statements

    A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    branch-and-cut algorithm
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    polar cut
    0 references
    semidefinite relaxation
    0 references