Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
From MaRDI portal
Publication:493691
DOI10.1007/S10589-015-9731-YzbMath1346.90603OpenAlexW2001149695MaRDI QIDQ493691
Fatemeh Bani Asadi Rad, Felix Lieder, Florian Jarre
Publication date: 4 September 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9731-y
Related Items (5)
On Integrality in Semidefinite Programming for Discrete Optimization ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ On the Lovász theta function and some variants ⋮ Simplified semidefinite and completely positive relaxations ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the Shannon capacity of a graph
- How Good is the Goemans--Williamson MAX CUT Algorithm?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Fixing Variables in Semidefinite Relaxations
This page was built for publication: Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
