Lecture notes in computer science

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

Christoph Buchheim, Long Trieu

Published Jan 1, 2014• 5 citations

Related papers

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

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

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

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints

Christoph Buchheim, Long Trieu

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

Eric Newby, M. Montaz Ali

An efficient compact quadratic convex reformulation for general integer quadratic programs

Alain Billionnet, Sourour Elloumi, Amélie Lambert