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

DOI10.1007/978-3-642-13036-6_22MaRDI QIDQ3569825zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Alberto Caprara, Andrea Lodi

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

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

Recommendations

• An effective branch-and-bound algorithm for convex quadratic integer programming
• Ellipsoid bounds for convex quadratic integer programming
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
• Active set methods with reoptimization for convex quadratic integer programming
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations

Cited in

(20)

• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
• A new variable reduction technique for convex integer quadratic programs
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
• Active set methods with reoptimization for convex quadratic integer programming
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
• Ellipsoid bounds for convex quadratic integer programming
• Integer quadratic optimization
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• A decision space algorithm for multiobjective convex quadratic integer optimization
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
• On the separation of split inequalities for non-convex quadratic integer programming
• A polynomial case of convex integer quadratic programming problems with box integer constraints
• Convex quadratic mixed-integer problems with quadratic constraints
• A new branch-and-bound algorithm for solving large-scale complex integer convex quadratic programming problems
• A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
• An effective branch-and-bound algorithm for convex quadratic integer programming

This page was built for publication: An effective branch-and-bound algorithm for convex quadratic integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569825)