Gap inequalities for the cut polytope
From MaRDI portal
Publication:1911843
DOI10.1006/eujc.1996.0020zbMath0849.52010OpenAlexW2084788931MaRDI QIDQ1911843
Monique Laurent, Svatopluk Poljak
Publication date: 29 October 1996
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/abb41d31aa164b421f47a89d95c5cad53cb4bbb4
Related Items
Linear transformation based solution methods for non-convex mixed integer quadratic programs, The Boolean Quadric Polytope, Generalised 2-circulant inequalities for the max-cut problem, \texttt{EXPEDIS}: an exact penalty method over discrete sets, Improved semidefinite bounding procedure for solving max-cut problems to optimality, A guide to conic optimisation and its applications, Projection results for the \(k\)-partition problem, A note on convex reformulation schemes for mixed integer quadratic programs, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Membership testing for Bernoulli and tail-dependence matrices
