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

On the complexity of quadratic programming with two quadratic constraints

Luca Consolini, Marco Locatelli

Published Oct 1, 2016• 19 citations
Publisher
DOI
10.1007/s10107-016-1073-8

Related papers

Approximating quadratic programming with bound and quadratic constraints

Yinyu Ye

Mathematical Programming•Feb 1, 1999•170 citations

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

Wen-Yang Ku, J. Christopher Beck

Lecture notes in computer science•Jan 1, 2016•2 citations

A polynomial case of convex integer quadratic programming problems with box integer constraints

Chunli Liu, Jianjun Gao

Journal of Global Optimization•Jan 6, 2015•5 citations

Quadratic convex reformulations for a class of complex quadratic programming problems

Cheng Zhu Lu, Gaojian Kang, Guangtai Qu +1 more

Computational Optimization and Applications•Mar 12, 2025•0 citations

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

Xiaojin Zheng, Yutong Pan, Xueting Cui

Journal of Global Optimization•Feb 26, 2018•2 citations

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints

Yasutoshi Yajima, Tetsuya Fujie

Journal of Global Optimization•Sep 1, 1998•49 citations