Stronger linear programming relaxations of max-cut
From MaRDI portal
Publication:1403298
DOI10.1007/s10107-003-0423-5zbMath1106.90379OpenAlexW2047609571MaRDI QIDQ1403298
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0423-5
Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
The Boolean Quadric Polytope, A polyhedral approach to the single row facility layout problem, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, Gap inequalities for non-convex mixed-integer quadratic programs, Complexity results for the gap inequalities for the max-cut problem, Binary positive semidefinite matrices and associated integer polytopes, A guide to conic optimisation and its applications, Exploring the relationship between max-cut and stable set relaxations, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Spectral bounds for the maximum cut problem, Metric-Constrained Optimization for Graph Clustering Algorithms
Uses Software
