12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Small bipartite subgraph polytopes
View graph of relations

« Back

Small bipartite subgraph polytopes

Research output: Contribution to journalJournal article

Published

Journal publication date2010
JournalOperations Research Letters
Journal number5
Volume38
Number of pages4
Pages337-340
Original languageEnglish

Abstract

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.