A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

Details A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

2009-07-26

arxiv.org/abs/0907.4518v2

Mathematics

Optimization and Control

23 pages. To appear in Math. Programming

Scientific paper

10.1007/s10107-010-0425-z

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avoids certain minors we can characterize when the first theta body in the hierarchy equals the cycle polytope of the matroid. Specialized to cuts in graphs, this result solves a problem posed by Lov\'asz.

Affiliated with

Also associated with

No associations

Rating

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245443