Binary Positive Semidefinite Matrices and Associated Integer Polytopes
From MaRDI portal
Recommendations
- Binary positive semidefinite matrices and associated integer polytopes
- On a positive semidefinite relaxation of the cut polytope
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Polytopes of minimum positive semidefinite rank
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
Cites work
- Clique-Web Facets for Multicut Polytopes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Discrete and Computational Geometry
- Facets for the cut cone. I
- Facets of the clique partitioning polytope
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 1516564 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On a positive semidefinite relaxation of the cut polytope
- On the cone of positive semidefinite matrices
- On the cut polytope
- On the Facial Structure of the Set of Correlation Matrices
- On the Shannon capacity of a graph
- Semidefinite programming and integer programming
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Stronger linear programming relaxations of max-cut
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The clique partitioning problem: Facets and patching facets
- The hypermetric cone is polyhedral
- The Hypermetric Cone on Seven Vertices
Cited in
(2)
This page was built for publication: Binary Positive Semidefinite Matrices and Associated Integer Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503844)
