Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization

Abstract

The exact solution of the NP-hard Maximum Cut Problem is important in many applications across, e.g., Physics, Chemistry, Neuroscience, and Circuit Layout – which is also due to its equivalence to the unconstrained Binary Quadratic Optimization Problem. Leading solution methods are based on linear or semidefinite programming, and require the separation of the so-called odd-cycle inequalities. In their groundbreaking work, F. Barahona and A.R. Mahjoub have given an informal description of a polynomial-time algorithm for this problem. As pointed out recently, however, additional effort is necessary to guarantee that the obtained inequalities correspond to facets of the cut polytope. In this paper, we shed more light on a so enhanced separation procedure and investigate experimentally how it performs in comparison to an ideal setting where one could even employ the sparsest, most violated, or geometrically most promising facet-defining odd-cycle inequalities

Similar works

Full text

thumbnail-image

computer science publication server

redirect
Last time updated on 20/11/2020

This paper was published in computer science publication server.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.