Convex reformulation for binary quadratic programming problems via average objective value maximization
type: Item
instance of: scholarly article
title: Convex reformulation for binary quadratic programming problems via average objective value maximization
zbMATH Open document ID: 1317.90227
author: Cheng Lu
author: Xiao-ling Guo
published in: Optimization Letters
publication date: 2015-03-25T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6419586
zbMATH Keywords: binary quadratic programming
zbMATH Keywords: lower bounds
zbMATH Keywords: branch-and-bound
zbMATH Keywords: convex reformulation
MaRDI profile type: Publication
full work available at URL: s11590-014-0768-0
OpenAlex ID: W2147198066
cites work: Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Q4198056
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: New bounds on the unconstrained quadratic integer programming problem
cites work: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
cites work: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation
cites work: Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Convex Relaxations of (0, 1)-Quadratic Programming
cites work: On duality gap in binary quadratic programming
cites work: Semidefinite Programming
cites work: Q4254875
DOI: 10.1007/S11590-014-0768-0
description: scientific article; zbMATH DE number 6419586