Parametric Lagrangian dual for the binary quadratic programming problem
From MaRDI portal
Publication:2018469
Recommendations
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Duality gap estimation of linear equality constrained binary quadratic programming
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Cites work
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A Decomposition Method for Quadratic Zero-One Programming
- A Spectral Bundle Method for Semidefinite Programming
- A polynomial case of unconstrained zero-one quadratic optimization
- A quadratic assignment formulation of the molecular conformation problem
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A solvable class of quadratic 0-1 programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Convex Relaxations of (0, 1)-Quadratic Programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Laplacian eigenvalues and the maximum cut problem
- Minimum cuts and related problems
- New bounds on the unconstrained quadratic integer programming problem
- New semidefinite programming relaxations for box constrained quadratic program
- Nonlinear integer programming
- On duality gap in binary quadratic programming
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Partition of Space
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Reverse search for enumeration
- Semidefinite Programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(5)- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A survey of hidden convex optimization
- Bi-parametric convex quadratic optimization
- Duality gap estimation of linear equality constrained binary quadratic programming
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
This page was built for publication: Parametric Lagrangian dual for the binary quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018469)
