New bounds on the unconstrained quadratic integer programming problem
From MaRDI portal
Publication:925231
DOI10.1007/s10898-007-9155-zzbMath1146.90041OpenAlexW2151954274MaRDI QIDQ925231
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9155-z
Related Items
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ Convex reformulation for binary quadratic programming problems via average objective value maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook of test problems in local and global optimization
- Laplacian eigenvalues and the maximum cut problem
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Reverse search for enumeration
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- The Vector Partition Problem for Convex Objective Functions
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Maximally Robust Controllers for Multivariable Systems
- Convex Relaxations of (0, 1)-Quadratic Programming
- On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
- Partition of Space
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A polynomial case of unconstrained zero-one quadratic optimization
