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

Related papers

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

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

Christoph Buchheim, Alberto Caprara, Andrea Lodi

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

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

Christoph Buchheim, Long Trieu

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

Christoph Buchheim, Emiliano Traversi