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

DOI10.1007/978-3-642-13036-6_22zbMath1285.90025OpenAlexW1494579955MaRDI QIDQ3569825

Andrea Lodi, Christoph Buchheim, Alberto Caprara

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_22

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items (2)

Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ On the separation of split inequalities for non-convex quadratic integer programming

This page was built for publication: An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming