Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
DOI10.1016/J.EJOR.2011.10.034zbMATH Open1244.90162DBLPjournals/eor/XiaSSL12OpenAlexW1970309689WikidataQ57445445 ScholiaQ57445445MaRDI QIDQ439501FDOQ439501
Authors: Yong Xia, Ruey-Lin Sheu, Xiaoling Sun, Duan Li 
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
Recommendations
- Duality gap estimation of linear equality constrained binary quadratic programming
- On duality gap in binary quadratic programming
- On reduction of duality gap in quadratic knapsack problems
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Parametric Lagrangian dual for the binary quadratic programming problem
semidefinite relaxationquadratic binary programmingcell enumeration and hyperplane arrangementLagrangian duality gapweighted distance measure
Cites Work
- Semidefinite Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Nonlinear Programming
- Reverse search for enumeration
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Towards strong duality in integer programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- On duality gap in binary quadratic programming
- Semidefinite programming
- Title not available (Why is that?)
- Duality gap estimation of linear equality constrained binary quadratic programming
- Spectral bounds for the maximum cut problem
Cited In (4)
Uses Software
This page was built for publication: Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439501)
