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 Computation

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

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

Published Feb 24, 2018• 38 citations
Publisher
DOI
10.1007/s12532-018-0133-x

Related papers

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints

Yasutoshi Yajima, Tetsuya Fujie

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

Globally solving nonconvex quadratic programming problems via completely positive programming

Jieqiu Chen, Samuel Burer

Mathematical Programming Computation•Nov 16, 2011•108 citations

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box

安敏 矢島, Yasutoshi Yajima

•Jan 1, 1998•0 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

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•1 citation

Bilinear programming methods for nonconvex quadratic problems

Springer eBooks•Oct 5, 2005•1 citation