Galli, Laura and Grainger, Daniel J. and Letchford, Adam N. (2018) Bit Representation Can Improve SDP Relaxations of Mixed-Integer Quadratic Programs. TR . Università di Pisa, Pisa, IT. (Unpublished)
| PDF (Technical Report) Available under License Creative Commons Attribution No Derivatives. Download (341Kb) | Preview |
Official URL: http://www.di.unipi.it/it/ricerca/tr
Abstract
A standard trick in integer programming is to replace bounded integer variables with binary variables, using a bit representation. In a previous paper, we showed that this process can be used to improve linear programming relaxations of mixed-integer quadratic programs. In this paper, we show that it can also be used to improve {\em semidefinite}\/ programming relaxations.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | mixed-integer nonlinear programming, global optimisation, semidefinite programming |
Subjects: | Area01 - Scienze matematiche e informatiche > MAT/09 - Ricerca operativa |
Divisions: | Dipartimenti (from 2013) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | Dr Laura Galli |
Date Deposited: | 18 Jul 2018 09:13 |
Last Modified: | 18 Jul 2018 09:13 |
URI: | http://eprints.adm.unipi.it/id/eprint/2384 |
Repository staff only actions
View Item |