Testing the non-diagonal quadratic convex reformulation technique

Otto Nissfolk, Ray Pörn, Tapio Westerlund

Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

1 Citation (Scopus)

Abstract

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).
Original languageUndefined/Unknown
Title of host publication26th European Symposium on Computer Aided Process Engineering
EditorsZdravko Kravanja
PublisherElsevier
Pages331–336
ISBN (Electronic)9780444634443
ISBN (Print)9780444634283
DOIs
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventEuropean Symposium on Computer Aided Process Engineering - 26th European Symposium on Computer Aided Process Engineering
Duration: 12 Jun 201615 Jun 2016

Conference

ConferenceEuropean Symposium on Computer Aided Process Engineering
Period12/06/1615/06/16

Cite this