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

Nature

Relaxation after a tight squeeze

Ehud Altman, Eugene Demler

Published Sep 1, 2007• 2 citations
Publisher
DOI
10.1038/449296a

Related papers

Squeeze it tight

Chen-Yu Wang

Nature Physics•Jan 1, 2024•1 citation

Relaxation Effects

WORLD SCIENTIFIC eBooks•Oct 1, 2008•0 citations

THE TIGHTNESS OF STRENGTHENED SEMIDEFINITE RELAXATIONS FOR THE BOOLEAN QUADRATIC PROGRAMMING PROBLEM WITH GENERALIZED UPPER BOUND CONSTRAINTS

Hitarth Sharma, Rupaj Kumar Nayak

ABSTRACT This paper studies semidefinite programming (SDP) relaxations for the Boolean Quadratic Programming problem with Generalized Upper Bound constraints (BQP-GUB), which arises in several application domains. We show that conventional semidefinite relaxation (SDR) does not yield tight bounds for this problem. We then analyze strengthened SDP relaxations and identify formulations that produce tight or near-tight bounds, particularly those based on reduced reformulation-linearization techniques (SDR+RRLT and SSDR+RRLT. Numerical experiments demonstrate that these approaches significantly reduce the relaxation gap compared to SDR, while highlighting the trade-off between bound quality and computational scalability.

Pesquisa Operacional•Jan 1, 2026•0 citations

Feeling the squeeze

George A. Brawley, Warwick P. Bowen

Nature Photonics•Oct 30, 2013•4 citations

On the tightness of SDP relaxations of QCQPs with repeated eigenvalues

Alex L. Wang, Fatma Kılınç-Karzan

arXiv:1911.09195•Nov 20, 2019•0 citations

Squeeze until it hurts

Geoff J. Pryde

Nature•Dec 31, 2008•0 citations
ABSTRACT This paper studies semidefinite programming (SDP) relaxations for the Boolean Quadratic Programming problem with Generalized Upper Bound constraints (BQP-GUB), which arises in several application domains. We show that conventional semidefinite relaxation (SDR) does not yield tight bounds for this problem. We then analyze strengthened SDP relaxations and identify formulations that produce tight or near-tight bounds, particularly those based on reduced reformulation-linearization techniques (SDR+RRLT and SSDR+RRLT. Numerical experiments demonstrate that these approaches significantly reduce the relaxation gap compared to SDR, while highlighting the trade-off between bound quality and computational scalability.