A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
From MaRDI portal
Publication:1728372
Recommendations
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Representability in mixed integer programming. I: Characterization results
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Linear programming for the \(0-1\) quadratic knapsack problem
- Unbounded convex sets for non-convex mixed-integer quadratic programming
Cites work
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A semidefinite programming approach to the quadratic knapsack problem
- A Spectral Bundle Method for Semidefinite Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Exact Solution of the Quadratic Knapsack Problem
- Gap inequalities for non-convex mixed-integer quadratic programs
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Pseudo-Boolean optimization
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Unbounded convex sets for non-convex mixed-integer quadratic programming
This page was built for publication: A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728372)
