An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
From MaRDI portal
Publication:609569
DOI10.1007/s10898-009-9504-1zbMath1205.90200OpenAlexW2152442947MaRDI QIDQ609569
Cheng Lu, Zhen-bo Wang, Wen-Xun Xing
Publication date: 1 December 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9504-1
Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
New semidefinite programming relaxations for box constrained quadratic program, Canonical dual approach to solving the maximum cut problem, 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
- New bounds on the unconstrained quadratic integer programming problem
- Canonical dual approach to solving 0-1 quadratic programming problems
- Global extremal conditions for multi-integer quadratic programming
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Reverse search for enumeration
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximally Robust Controllers for Multivariable Systems
- On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
- A polynomial case of unconstrained zero-one quadratic optimization
