Convex reformulation for binary quadratic programming problems via average objective value maximization
From MaRDI portal
Publication:2018868
DOI10.1007/s11590-014-0768-0zbMath1317.90227OpenAlexW2147198066MaRDI QIDQ2018868
Publication date: 25 March 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0768-0
Related Items
Conic approximation to quadratic optimization with linear complementarity constraints, A new branch-and-bound approach to semi-supervised support vector machine, Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming, A neurodynamic approach to zero-one quadratic programming, A new effective branch-and-bound algorithm to the high order MIMO detection problem, An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality gap in binary quadratic programming
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- New bounds on the unconstrained quadratic integer programming problem
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- 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
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
