New bounds on the unconstrained quadratic integer programming problem
type: Item
instance of: scholarly article
title: New bounds on the unconstrained quadratic integer programming problem
zbMATH Open document ID: 1146.90041
author: Elsie Sterbin Gottlieb
published in: Journal of Global Optimization
publication date: 2008-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5281927
zbMATH Keywords: semidefinite relaxation
zbMATH Keywords: zonotope
zbMATH Keywords: hyperplane arrangements
MaRDI profile type: Publication
full work available at URL: s10898-007-9155-z
OpenAlex ID: W2151954274
cites work: A polynomial case of unconstrained zero-one quadratic optimization
cites work: Reverse search for enumeration
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Partition of Space
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Q3772828
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Handbook of test problems in local and global optimization
cites work: Q4198056
cites work: Maximally Robust Controllers for Multivariable Systems
cites work: On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation
cites work: The vector partition problem for convex objective functions.
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Convex Relaxations of (0, 1)-Quadratic Programming
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
DOI: 10.1007/S10898-007-9155-Z
Recommended article: Une borne optimale pour la programmation entière quasi-convexe
Recommended article: A new branch and bound algorithm for integer quadratic programming problems
Recommended article: New bounds for nonconvex quadratically constrained quadratic programming
Recommended article: Q3737236
Recommended article: Q3461341
Recommended article: Q3017743
Recommended article: Q4858721
Recommended article: A new bound for the quadratic assignment problem based on convex quadratic programming
Recommended article: On boundedness of (quasi-)convex integer optimization problems
Recommended article: Q5257323
description: scientific article; zbMATH DE number 5281927