A tight semidefinite relaxation of the MAX CUT problem

DOI10.1023/A:1027364420370zbMath1175.90335MaRDI QIDQ1417849

San-Yang Liu, Hong-Wei Liu, Feng-Min Xu

Publication date: 6 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

cut polytopesemidefinite relaxationmetric polytopeMAX CUT problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

A continuation algorithm for max-cut problem ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization

Uses Software

• SDPpack

This page was built for publication: A tight semidefinite relaxation of the MAX CUT problem