Ellipsoidal approach to box-constrained quadratic problems
From MaRDI portal
Publication:1424957
DOI10.1023/B:JOGO.0000006654.34226.fezbMath1134.90459MaRDI QIDQ1424957
Immanuel M. Bomze, Pasquale L. De Angelis, Gerardo Toraldo
Publication date: 15 March 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
On characterization of maximal independent sets via quadratic optimization ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Convex programming with single separable constraint and bounded variables ⋮ (Global) optimization: historical notes and recent developments ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Lower bound improvement and forcing rule for quadratic binary programming
This page was built for publication: Ellipsoidal approach to box-constrained quadratic problems
