Convex reformulation for binary quadratic programming problems via average objective value maximization
From MaRDI portal
Publication:2018868
Recommendations
- Structured linear reformulation of binary quadratically constrained quadratic programs
- A note on convex reformulation schemes for mixed integer quadratic programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
Cites work
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Convex Relaxations of (0, 1)-Quadratic Programming
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- New bounds on the unconstrained quadratic integer programming problem
- On duality gap in binary quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(12)- 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 new effective branch-and-bound algorithm to the high order MIMO detection problem
- Structured linear reformulation of binary quadratically constrained quadratic programs
- A neurodynamic approach to zero-one quadratic programming
- A note on convex reformulation schemes for mixed integer quadratic programs
- An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Conic approximation to quadratic optimization with linear complementarity constraints
- A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
This page was built for publication: Convex reformulation for binary quadratic programming problems via average objective value maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018868)
