A new separation algorithm for the Boolean quadric and cut polytopes

Letchford, Adam and Sorensen, Michael M. (2014) A new separation algorithm for the Boolean quadric and cut polytopes. Discrete Optimization, 14. pp. 61-71. ISSN 1572-5286

Full text not available from this repository.

Abstract

A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero-one quadratic programming and the maxcut problem, respectively. We present a new algorithm, which separates over a class of valid inequalities that includes all odd bicycle wheel inequalities and (2p + 1, 2)-circulant inequalities. It exploits, in a non-trivial way, three known results in the literature: one on the separation of {0,1/2}-cuts, one on the symmetries of the polytopes in question, and one on an affine mapping between the polytopes.

Item Type:
Journal Article
Journal or Publication Title:
Discrete Optimization
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
69989
Deposited By:
Deposited On:
14 Jul 2014 08:04
Refereed?:
Yes
Published?:
Published
Last Modified:
18 Mar 2020 04:21