Transformation-based preprocessing for mixed-integer quadratic programs
DOI10.1007/S10957-015-0806-9zbMATH Open1338.90276OpenAlexW2151532428WikidataQ57931865 ScholiaQ57931865MaRDI QIDQ283953FDOQ283953
Authors: Eric Newby, M. Montaz Ali 
Publication date: 17 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0806-9
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
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11) Linear transformations, semilinear transformations (15A04)
Cites Work
- Matlab
- BARON: A general purpose global optimization software package
- SCIP: solving constraint integer programs
- Benchmarking optimization software with performance profiles.
- A note on convex reformulation schemes for mixed integer quadratic programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
Cited In (5)
- Title not available (Why is that?)
- 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
Uses Software
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)
