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

Mathematical Programming

Approximating quadratic programming with bound and quadratic constraints

Yinyu Ye

Published Feb 1, 1999• 170 citations
Publisher
DOI
10.1007/s10107980012a

Related papers

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

Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints

Marco Locatelli, Veronica Piccialli, Antonio M. Sudoso

arXiv:2211.08911•Mathematical Programming Computation•Nov 5, 2024•4 citations

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints

Christoph Buchheim, Long Trieu

Lecture notes in computer science•Jan 1, 2013•12 citations

On the complexity of quadratic programming with two quadratic constraints

Luca Consolini, Marco Locatelli

Mathematical Programming•Oct 1, 2016•19 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

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