Testing the non-diagonal quadratic convex reformulation technique

A4 Conference proceedings

Internal Authors/Editors

Publication Details

List of Authors: Otto Nissfolk, Ray Pörn, Tapio Westerlund
Editors: Zdravko Kravanja
Publisher: Elsevier
Place: Amsterdam
Publication year: 2016
Journal: Computer Aided Chemical Engineering
Publisher: Elsevier
Book title: 26th European Symposium on Computer Aided Process Engineering
Title of series: Computer-aided chemical engineering
Volume number: 38
Start page: 331
End page: 336
ISBN: 9780444634283
eISBN: 9780444634443
ISSN: 1570-7946


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).

Last updated on 2019-20-10 at 04:56