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:1403.3998 · Journal of the Operations Research Society of China

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

Zi Li Xu, Ming-Yi Hong

Published Jul 7, 2015• 3 citations
arXivHTMLPDF
DOI
10.1007/s40305-015-0082-2

Related papers

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•1 citation

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

Mathematical Programming•May 17, 2011•133 citations

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

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Advances in intelligent systems and computing•Jun 14, 2019•3 citations

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

Cheng Zhu Lu, Zhenbo Wang, Wenxun Xing

Journal of Global Optimization•Dec 17, 2009•6 citations

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