Combining semidefinite and polyhedral relaxations for integer programs
From MaRDI portal
Publication:5101410
Recommendations
- A semidefinite programming approach to the quadratic knapsack problem
- Semidefinite relaxations for integer programming
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming and integer programming
Cites work
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An Interior-Point Method for Semidefinite Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Experiments in quadratic 0-1 programming
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- Laplacian eigenvalues and the maximum cut problem
- On the Shannon capacity of a graph
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- The cut polytope and the Boolean quadric polytope
Cited in
(19)- A semidefinite programming approach to the quadratic knapsack problem
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Semidefinite and Lagrangian relaxations for hard combinatorial problems
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- Linear programming relaxations of quadratically constrained quadratic programs
- Semidefinite relaxations for mixed 0-1 second-order cone program
- Ap-cone sequential relaxation procedure for 0-1 integer programs
- Semidefinite relaxations for integer programming
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- Fixing Variables in Semidefinite Relaxations
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Semidefinite programming and combinatorial optimization
- On Integrality in Semidefinite Programming for Discrete Optimization
- Tight SDP relaxations for cardinality-constrained problems
- Fixing variables in semidefinite relaxations
- The equivalence of semidefinite relaxations of polynomial 0-1 and 1 programs via scaling
This page was built for publication: Combining semidefinite and polyhedral relaxations for integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101410)
