An effective branch-and-bound algorithm for convex quadratic integer programming
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1346524 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- An algorithmic framework for convex mixed integer nonlinear programs
- An evolutionary heuristic for quadratic 0-1 programming
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Integer Programming and Combinatorial Optimization
- On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- The cut polytope and the Boolean quadric polytope
Cited in
(39)- 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 fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- A numerical method for solving quadratic integer programming problem
- A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
- Active set methods with reoptimization for convex quadratic integer programming
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A semidefinite programming method for integer convex quadratic minimization
- An ADMM based method for underdetermined box-constrained integer least squares problems
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Extensions on ellipsoid bounds for quadratic integer programming
- Ellipsoid bounds for convex quadratic integer programming
- An algorithm to solve multi-objective integer quadratic programming problem
- 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
- Compactness and convergence rates in the combinatorial integral approximation decomposition
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Dual mean field search for large scale linear and quadratic knapsack problems
- scientific article; zbMATH DE number 7366738 (Why is no real title available?)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- Domain decomposition for integer optimal control with total variation regularization
- Optimization over structured subsets of positive semidefinite matrices via column generation
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Sequential linear integer programming for integer optimal control with total variation regularization
- When is rounding allowed in integer nonlinear optimization?
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Convex quadratic mixed-integer problems with quadratic constraints
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Relaxed multibang regularization for the combinatorial integral approximation
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- 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
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)
