Galli, L and Letchford, A N (2010) Small bipartite subgraph polytopes. Operations Research Letters, 38 (5). pp. 337-340. ISSN 0167-6377
Preview
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.
Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Uncontrolled Keywords:
/dk/atira/pure/core/keywords/managementscience
Subjects:
?? polyhedral combinatoricsmax-cut problemintegrality ratiosmanagement sciencemanagement science and operations researchsoftwareapplied mathematicsindustrial and manufacturing engineeringhb economic theorydiscipline-based research ??
Departments:
ID Code:
45606
Deposited By:
Deposited On:
11 Jul 2011 18:35
Refereed?:
Yes
Published?:
Published
Last Modified:
10 Nov 2024 01:04