Fixing Variables in Semidefinite Relaxations
From MaRDI portal
Recommendations
- Fixing variables in semidefinite relaxations
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Semidefinite programming relaxations for the quadratic assignment problem
- Combining semidefinite and polyhedral relaxations for integer programs
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
Cited in
(24)- Fixing variables in semidefinite relaxations
- On Integrality in Semidefinite Programming for Discrete Optimization
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- A framework for solving mixed-integer semidefinite programs
- Mathematical programming models and exact algorithms
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Semidefinite programming
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- A Derivation of Lovász' Theta via Augmented Lagrange Duality
- On different versions of the exact subgraph hierarchy for the stable set problem
- A guide to conic optimisation and its applications
- scientific article; zbMATH DE number 1875413 (Why is no real title available?)
- Maximum-entropy sampling and the Boolean quadric polytope
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Semidefinite relaxations of ordering problems
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- On parametric semidefinite programming
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- Semidefinite programming and constraint programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- The equivalence of semidefinite relaxations of polynomial 0-1 and 1 programs via scaling
This page was built for publication: Fixing Variables in Semidefinite Relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943670)
