Home > Research > Publications & Outputs > A new separation algorithm for the Boolean quad...

Associated organisational unit

View graph of relations

A new separation algorithm for the Boolean quadric and cut polytopes

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2/08/2014
<mark>Journal</mark>Discrete Optimization
Number of pages11
Pages (from-to)61-71
Publication StatusPublished
<mark>Original language</mark>English


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.