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

A simple polynomial-time algorithm for convex quadratic programming

Paul Tseng, Decision Systems.

Published Jan 1, 1988• 7 citations
OpenAlex

Related papers

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

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Lecture notes in computer science•Jan 1, 2010•10 citations

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

arXiv:1901.07904•Journal of Global Optimization•Jan 4, 2021•24 citations

An effective branch-and-bound algorithm for convex quadratic integer programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Mathematical Programming•Jul 14, 2011•57 citations

Quadratic convex reformulations for quadratic 0–1 programming

Marie-Christine Plateau

4OR•May 29, 2007•4 citations

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Neurocomputing•Mar 9, 2016•5 citations