Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
From MaRDI portal
Publication:439501
DOI10.1016/j.ejor.2011.10.034zbMath1244.90162OpenAlexW1970309689WikidataQ57445445 ScholiaQ57445445MaRDI QIDQ439501
Xiaoling Sun, Yong Xia, Ruey-Lin Sheu, Li, Duan
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.034
semidefinite relaxationquadratic binary programmingcell enumeration and hyperplane arrangementLagrangian duality gapweighted distance measure
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality gap in binary quadratic programming
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Semidefinite programming
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Reverse search for enumeration
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Towards strong duality in integer programming
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
- Spectral bounds for the maximum cut problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Semidefinite Programming
- Nonlinear Programming
