Now showing items 1-2 of 2
Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs
Semidefinite relaxation for certain discrete optimization problems involves replacing a vector-valued variable by a matrix-valued one, producing a convex program while increasing the number of variables by an order of ...
Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization
The stability number for a given graph G is the size of a maximum stable set in G. The Lovasz theta number provides an upper bound on the stability number and can be computed as the optimal value of the Lovasz semidefinite ...