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

arXiv:1901.10335 · Journal of Global Optimization

SDP-based branch-and-bound for non-convex quadratic integer optimization

Christoph Buchheim, Maribel Montenegro, Angelika Wiegele

Published Oct 29, 2018• 6 citations
arXivHTMLPDF
DOI
10.1007/s10898-018-0717-z

Related papers

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

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

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Mathematical Programming•Jul 14, 2011•57 citations

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Journal of Combinatorial Optimization•Nov 13, 2012•7 citations

Linear transformation based solution methods for non-convex mixed integer quadratic programs

Eric Newby, M. Montaz Ali

Optimization Letters•Dec 26, 2015•1 citation

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

On the separation of split inequalities for non-convex quadratic integer programming

Christoph Buchheim, Emiliano Traversi

Discrete Optimization•Nov 25, 2014•7 citations