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

Science in China Series A Mathematics

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

Dachuan Xu, Shu-zhong Zhang

Published Jul 30, 2007• 7 citations
Publisher
DOI
10.1007/s11425-007-0080-x

Related papers

On approximating complex quadratic optimization problems via semidefinite programming relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Mathematical Programming•Dec 12, 2006•231 citations

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Lecture notes in computer science•Jan 1, 2005•111 citations

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

Zi Li Xu, Ming-Yi Hong

arXiv:1403.3998•Journal of the Operations Research Society of China•Jul 7, 2015•3 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•55 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•53 citations

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

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Mathematical Programming•Jul 21, 2008•6 citations