An effective branch-and-bound algorithm for convex quadratic integer programming
From MaRDI portal
Publication:715081
DOI10.1007/S10107-011-0475-XzbMATH Open1254.90121OpenAlexW2088053023MaRDI QIDQ715081FDOQ715081
Authors: Christoph Buchheim, Alberto Caprara, Andrea Lodi 
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0475-x
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
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10)
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- Title not available (Why is that?)
- On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An evolutionary heuristic for quadratic 0-1 programming
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- The cut polytope and the Boolean quadric polytope
- Title not available (Why is that?)
- Integer Programming and Combinatorial Optimization
Cited In (37)
- On minimal valid inequalities for mixed integer conic programs
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- A new variable reduction technique for convex integer quadratic programs
- A numerical method for solving quadratic integer programming problem
- 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
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- An ADMM based method for underdetermined box-constrained integer least squares problems
- A semidefinite programming method for integer convex quadratic minimization
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Ellipsoid bounds for convex quadratic integer programming
- An algorithm to solve multi-objective integer quadratic programming problem
- Extensions on ellipsoid bounds for quadratic integer programming
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- 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
- Compactness and convergence rates in the combinatorial integral approximation decomposition
- Title not available (Why is that?)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Dual mean field search for large scale linear and quadratic knapsack problems
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Sequential linear integer programming for integer optimal control with total variation regularization
- Optimization over structured subsets of positive semidefinite matrices via column generation
- When is rounding allowed in integer nonlinear optimization?
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Convex quadratic mixed-integer problems with quadratic constraints
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Relaxed multibang regularization for the combinatorial integral approximation
- A new branch-and-bound algorithm for solving large-scale complex integer convex quadratic programming problems
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- 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
Uses Software
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 Q715081)
