Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

DOI10.1007/978-3-642-32147-4_17zbMath1370.90214OpenAlexW82446962WikidataQ57702168 ScholiaQ57702168MaRDI QIDQ3167623

Konstantinos Kaparis, Laura Galli, Adam N. Letchford

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_17

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The Boolean Quadric Polytope ⋮ A note on the 2-circulant inequalities for the MAX-cut problem

This page was built for publication: Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm