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

Journal of Global Optimization

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

Chunli Liu, Jianjun Gao

Published Jan 6, 2015• 5 citations
Publisher
DOI
10.1007/s10898-014-0263-2

Related papers

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints

Christoph Buchheim, Long Trieu

Lecture notes in computer science•Jan 1, 2013•12 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

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Pierre Bonami, Oktay Günlük, Jeff Linderoth

Mathematical Programming Computation•Feb 24, 2018•40 citations

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

International series in management science/operations research/International series in operations research & management science•Jan 1, 2017•0 citations

A new polynomially solvable class of quadratic optimization problems with box constraints

Milan Hladík, Michal Černý, Miroslav Rada

arXiv:1911.10877•Optimization Letters•Feb 19, 2021•7 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