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

@article{Anjos2002StrengthenedSR,
  title={Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem},
  author={Miguel F. Anjos and Henry Wolkowicz},
  journal={Discrete Applied Mathematics},
  year={2002},
  volume={119},
  pages={79-106}
}
In this paper we study two strengthened semidefinite programming relaxations for the Max-Cut problem. Our results hold for every instance of Max-Cut; in particular, we make no assumptions about the edge weights. We prove that the first relaxation provides a strengthening of the Goemans-Williamson relaxation. The second relaxation is a further tightening of the first one and we prove that its feasible set corresponds to a convex set that is larger than the cut polytope but nonetheless is… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 55 REFERENCES

Combinatorial optimization

  • M. X. GOEMANS, F. RENDL
  • H. Wolkowicz, R. Saigal, and L. Vandenberghe…
  • 2000
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…