Galli, L and Letchford, A N (2010) Small bipartite subgraph polytopes. Operations Research Letters, 38 (5). pp. 337-340. ISSN 0167-6377
![[img]](http://eprints.lancs.ac.uk/style/images/fileicons/application_pdf.png)
| PDF (Small bipartite subgraph polytopes) - Draft Version Download (272Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.orl.2010.05.004
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: | Article |
|---|---|
| Journal or Publication Title: | Operations Research Letters |
| Uncontrolled Keywords: | polyhedral combinatorics ; max-cut problem ; integrality ratios |
| Subjects: | H Social Sciences > HB Economic Theory |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 45606 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 11 Jul 2011 19:35 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 06 Feb 2013 16:53 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/45606 |
Actions (login required)
| View Item |
