Testing the non-diagonal quadratic convex reformulation technique

Otto Nissfolk, Ray Pörn, Tapio Westerlund

Forskningsoutput: Kapitel i bok/konferenshandlingKonferensbidragVetenskapligPeer review

1 Citeringar (Scopus)

Sammanfattning

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).
OriginalspråkOdefinierat/okänt
Titel på gästpublikation26th European Symposium on Computer Aided Process Engineering
RedaktörerZdravko Kravanja
FörlagElsevier
Sidor331–336
ISBN (elektroniskt)9780444634443
ISBN (tryckt)9780444634283
DOI
StatusPublicerad - 2016
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangEuropean Symposium on Computer Aided Process Engineering - 26th European Symposium on Computer Aided Process Engineering
Varaktighet: 12 jun 201615 jun 2016

Konferens

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

Citera det här