Binary Positive Semidefinite Matrices and Associated Integer Polytopes

We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and well-known integer polytopes -- the cut, boolean quadric, multicut and clique partitioning polytopes -- are shown to arise as projections of binary psd polytopes. Finally, we present various valid inequalities for binary psd polytopes, and show how they relate to inequalities known for the simpler polytopes mentioned. Along the way, we answer an open question in the literature on the max-cut problem, by showing that the so-called k-gonal inequalities define a polytope. Key Words: polyhedral combinatorics, semidefinite programming.

• Type: Conference
• Year: 2008
• Where: IPCO
• Authors: Adam N. Letchford, Michael M. Sørensen
• Keywords: Binary Psd Polytopes, Integer Polytopes, IPCO 2008, Optimization, Well-known Integer Polytopes