Parametric Lagrangian dual for the binary quadratic programming problem
From MaRDI portal
Publication:2018469
DOI10.1007/s10898-014-0164-4zbMath1334.90076OpenAlexW2056735991MaRDI QIDQ2018469
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0164-4
Related Items
A survey of hidden convex optimization, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New semidefinite programming relaxations for box constrained quadratic program
- 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
- A solvable class of quadratic 0-1 programming
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A quadratic assignment formulation of the molecular conformation problem
- Laplacian eigenvalues and the maximum cut problem
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Reverse search for enumeration
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Nonlinear integer programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Minimum cuts and related problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- A Spectral Bundle Method for Semidefinite Programming
- A Decomposition Method for Quadratic Zero-One Programming
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Partition of Space
- A polynomial case of unconstrained zero-one quadratic optimization
