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 Combinatorial Optimization

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

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Published Nov 13, 2012• 7 citations
Publisher
DOI
10.1007/s10878-012-9560-1

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•55 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

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

Christoph Buchheim, Maribel Montenegro, Angelika Wiegele

arXiv:1901.10335•Journal of Global Optimization•Oct 29, 2018•5 citations

Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming

Hoàng Tụy

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

An efficient compact quadratic convex reformulation for general integer quadratic programs

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Computational Optimization and Applications•Mar 23, 2012•16 citations