Extensions on ellipsoid bounds for quadratic integer programming
From MaRDI portal
Publication:721161
DOI10.1007/s10898-017-0557-2zbMath1421.90089OpenAlexW2750343997MaRDI QIDQ721161
Francisco Pinillos Nieto, Márcia H. C. Fampa
Publication date: 18 July 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0557-2
Related Items
Uses Software
Cites Work
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A continuous method for computing bounds in integer quadratic optimization problems
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Ellipsoidal approach to box-constrained quadratic problems
- On global optimization with indefinite quadratics
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- DC programming: overview.
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- When is rounding allowed in integer nonlinear optimization?
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
- Ellipsoid Bounds for Convex Quadratic Integer Programming
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
This page was built for publication: Extensions on ellipsoid bounds for quadratic integer programming
