Small bipartite subgraph polytopes

We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.

• Type: Journal
• Year: 2010
• Where: ORL
• Authors: Laura Galli, Adam N. Letchford
• Keywords: Bipartite Subgraph Polytope, Complete Linear Description, Conjectured Complete Description, ORL 2010