Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2928409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing Variables in Semidefinite Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burer's key assumption for semidefinite and doubly nonnegative relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Good is the Goemans--Williamson MAX CUT Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank

Revision as of 17:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
scientific article

    Statements

    Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2015
    0 references
    MAX-cut relaxation
    0 references
    MAX-clique problem
    0 references
    semidefinite program
    0 references
    completely positive program
    0 references
    0 references
    0 references

    Identifiers