Parametric Lagrangian dual for the binary quadratic programming problem
type: Item
instance of: scholarly article
title: Parametric Lagrangian dual for the binary quadratic programming problem
zbMATH Open document ID: 1334.90076
author: Yong Xia
author: Wenxun Xing
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6419078
zbMATH Keywords: binary quadratic program
zbMATH Keywords: semidefinite programming
zbMATH Keywords: lower bound
zbMATH Keywords: Lagrangian dual
zbMATH Keywords: D.C. decomposition
describes a project that uses: Biq Mac
MaRDI profile type: Publication
full work available at URL: s10898-014-0164-4
OpenAlex ID: W2056735991
cites work: A polynomial case of unconstrained zero-one quadratic optimization
cites work: Reverse search for enumeration
cites work: Partition of Space
cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
cites work: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
cites work: A solvable class of quadratic 0-1 programming
cites work: A Decomposition Method for Quadratic Zero-One Programming
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
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: A Spectral Bundle Method for Semidefinite Programming
cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
cites work: Nonlinear integer programming
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: An Implicit Enumeration Algorithm for Quadratic Integer Programming
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: A quadratic assignment formulation of the molecular conformation problem
cites work: Minimum cuts and related problems
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Convex Relaxations of (0, 1)-Quadratic Programming
cites work: A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
cites work: Q3802887
cites work: On duality gap in binary quadratic programming
cites work: Semidefinite Programming
cites work: New semidefinite programming relaxations for box constrained quadratic program
cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
DOI: 10.1007/S10898-014-0164-4
description: scientific article; zbMATH DE number 6419078