Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2308.01361 · Operations Research Letters

On relaxations of the max k-cut problem formulations

Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky B, Luis F. Zuluaga

Published Aug 8, 2023• 3 citations
arXivHTMLPDF
DOI
10.1016/j.orl.2023.08.001

Related papers

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

Dachuan Xu, Shu-zhong Zhang

Science in China Series A Mathematics•Jul 30, 2007•7 citations

Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B

Timotej Hrga, Janez Povh

Optimization Letters•Nov 4, 2022•4 citations

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Mathematical Programming•Jul 21, 2008•7 citations

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Springer eBooks•Jun 25, 2007•55 citations

A MAX-CUT formulation of 0/1 programs

Jean Bernard Lasserre

arXiv:1505.06840•Operations Research Letters•Dec 29, 2015•32 citations

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality

Nathan Krislock, Jérôme Malick, Frédéric Roupin

Mathematical Programming•Oct 13, 2012•57 citations