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

Springer eBooks

Bilinear programming methods for nonconvex quadratic problems

Published Oct 5, 2005• 1 citation
Publisher
DOI
10.1007/bfb0000042

Related papers

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•38 citations

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box

安敏 矢島, Yasutoshi Yajima

•Jan 1, 1998•0 citations

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

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

Ricardo M. Lima, Ignacio E. Grossmann

Computational Optimization and Applications•Jun 16, 2016•25 citations

Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming

Hoàng Tụy

Series on applied mathematics•Apr 1, 2002•1 citation