Pages that link to "Item:Q715081"

The following pages link to An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081):

Displaying 35 items.

• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints (Q473861) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• Integer quadratic optimization (Q759647) (← links)
• Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
• A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
• Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
• Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
• Compactness and convergence rates in the combinatorial integral approximation decomposition (Q2044969) (← links)
• Convex quadratic mixed-integer problems with quadratic constraints (Q2050251) (← links)
• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
• When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
• A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
• On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming (Q2817838) (← links)
• An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations (Q2866210) (← links)
• An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem (Q2886647) (← links)
• A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems (Q2886654) (← links)
• A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
• Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
• Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
• (Q4996611) (← links)
• Relaxed Multibang Regularization for the Combinatorial Integral Approximation (Q5009771) (← links)
• Sequential linear integer programming for integer optimal control with total variation regularization (Q5043062) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• A Numerical Method for Solving Quadratic Integer Programming Problem (Q5212531) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• An ADMM based method for underdetermined box-constrained integer least squares problems (Q6586913) (← links)
• An algorithm to solve multi-objective integer quadratic programming problem (Q6596965) (← links)