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

researchr

You are not signed in
Sign in
Sign up

Christoph Buchheim, Maribel Montenegro, Angelika Wiegele. SDP-based branch-and-bound for non-convex quadratic integer optimization. J. Global Optimization, 73(3):485-514, 2019. [doi]

The following publications are possibly variants of this publication:

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxationsChristoph Buchheim, Marianna De Santis, Laura Palagi. orl, 43(4):384-388, 2015. [doi]

An effective branch-and-bound algorithm for convex quadratic integer programmingChristoph Buchheim, Alberto Caprara, Andrea Lodi. mp, 135(1-2):369-395, 2012. [doi]

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer ProgrammingChristoph Buchheim, Alberto Caprara, Andrea Lodi. ipco 2010: 285-298 [doi]

runs on WebDSL