Ji et al. (2012) introduced a new reformulation technique for general 0-1 quadratic programs. They did not name it so we call it Non-Diagonal Quadratic Convex Reformulation (NDQCR). The reformulation technique is based on the Quadratic Convex Reformulation method developed by Billionnet et al. (2009, 2012, 2013). In this paper we test the NDQCR method. Specifically we test how the number of included non-diagonal elements affect the solution times for solved problems and also the solution qualities for problems not solved within the time-limit. We also present a new best known lower bound for the largest problem in the QAPLIB (2013), the tai256c problem introduced by Taillard (1995).
|Title of host publication||26th European Symposium on Computer Aided Process Engineering|
|Publication status||Published - 2016|
|MoE publication type||A4 Article in a conference publication|
|Event||European Symposium on Computer Aided Process Engineering - 26th European Symposium on Computer Aided Process Engineering|
Duration: 12 Jun 2016 → 15 Jun 2016
|Conference||European Symposium on Computer Aided Process Engineering|
|Period||12/06/16 → 15/06/16|