A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
From MaRDI portal
Publication:1728372
DOI10.1016/j.orl.2017.10.007zbMath1409.90129OpenAlexW2765372555MaRDI QIDQ1728372
Daniel J. Grainger, Adam N. Letchford
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/88224/1/miqp_note.pdf
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Gap inequalities for non-convex mixed-integer quadratic programs
- Pseudo-Boolean optimization
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Semidefinite programming relaxation for nonconvex quadratic programs
- A semidefinite programming approach to the quadratic knapsack problem
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Constrained 0-1 quadratic programming: basic approaches and extensions
- 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 Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact Solution of the Quadratic Knapsack Problem
- A Spectral Bundle Method for Semidefinite Programming
- Geometry of cuts and metrics
