A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
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...
| Main Authors: | , , , |
|---|---|
| Drugi avtorji: | |
| Format: | Article |
| Jezik: | en_US |
| Izdano: |
Springer
2011
|
| Online dostop: | http://hdl.handle.net/1721.1/62821 https://orcid.org/0000-0003-1132-8477 |