Pages that link to "Item:Q715081"
From MaRDI portal
The following pages link to An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081):
Displaying 20 items.
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← 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)
- 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)
- Compactness and convergence rates in the combinatorial integral approximation decomposition (Q2044969) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← 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)
- 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)
- 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)