Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem

Semidefinite programming for discrete optimization and matrix completion problems

Discrete Applied Mathematics

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

Computational Optimization and Applications

Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems

The Journal of Machine Learning Research

An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs

Annals of Mathematics and Artificial Intelligence

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

Operations Research Letters

Strong duality and minimal representations for cone optimization

Computational Optimization and Applications