Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Binary quadratic optimization problems that are difficult to solve by conic relaxations
scientific article

    Statements

    Binary quadratic optimization problems that are difficult to solve by conic relaxations (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    binary integer quadratic program
    0 references
    max-cut problem with equal weight
    0 references
    conic relaxations
    0 references
    hierarchy of semidefinite relaxations
    0 references
    inexact optimal values
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers