Pages that link to "Item:Q2866210"
From MaRDI portal
The following pages link to An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations (Q2866210):
Displaying 13 items.
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- A Numerical Method for Solving Quadratic Integer Programming Problem (Q5212531) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
