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

Computational Optimization and Applications

Faster, but weaker, relaxations for quadratically constrained quadratic programs

Samuel Burer, Sunyoung Kim, Masakazu Kojima

Published Nov 7, 2013• 14 citations
Publisher
DOI
10.1007/s10589-013-9618-8

Related papers

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

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

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

Exploiting Aggregate Sparsity in Second Order Cone Relaxations for Quadratic Constrained Quadratic Programming Problems

真 山下, Makoto Yamashita

•Sep 1, 2020•0 citations

Structured linear reformulation of binary quadratically constrained quadratic programs

Shan Jiang, Shu‐Cherng Fang, Tiantian Nie +1 more

Optimization Letters•Nov 17, 2018•1 citation

A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

Laura Galli, Adam N. Letchford

Optimization Letters•Jul 24, 2013•16 citations