An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
From MaRDI portal
Recommendations
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Ellipsoid bounds for convex quadratic integer programming
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
Cited in
(20)- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Best ellipsoidal relaxation to solve a nonconvex problem.
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- Lower bounds for cubic optimization over the sphere
- The generalized trust region subproblem: solution complexity and convex hull results
- A decision space algorithm for multiobjective convex quadratic integer optimization
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- Ellipsoid bounds for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- scientific article; zbMATH DE number 4080780 (Why is no real title available?)
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Dual approaches for a specific class of integer nonlinear programming problems
- Quadratic Combinatorial Optimization Using Separable Underestimators
- A numerical method for solving quadratic integer programming problem
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Extensions on ellipsoid bounds for quadratic integer programming
This page was built for publication: An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866210)
