Transformation-based preprocessing for mixed-integer quadratic programs
From MaRDI portal
Recommendations
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Advanced preprocessing techniques for linear and quadratic programming
- Preprocessing for quadratic programming
- A note on convex reformulation schemes for mixed integer quadratic programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
Cites work
- A note on convex reformulation schemes for mixed integer quadratic programs
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Matlab
- SCIP: solving constraint integer programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
Cited in
(5)- scientific article; zbMATH DE number 1786295 (Why is no real title available?)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Advanced preprocessing techniques for linear and quadratic programming
- A trajectory-based method for mixed integer nonlinear programming problems
- Preprocessing for quadratic programming
This page was built for publication: Transformation-based preprocessing for mixed-integer quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283953)