A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
type: Item
instance of: scholarly article
title: A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
zbMATH Open document ID: 1408.90219
author: Christoph Buchheim
author: M. De Santis
author: L. Palagi
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: http://hdl.handle.net/11573/839791
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6945375
zbMATH Keywords: integer programming
zbMATH Keywords: quadratic programming
zbMATH Keywords: global optimization
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W216476246
cites work: A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
cites work: An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming
cites work: Trust Region Methods
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: The generalized trust region subproblem
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Reduced RLT representations for nonconvex polynomial programming problems
DOI: 10.1016/J.ORL.2015.05.001
description: scientific article; zbMATH DE number 6945375