Advanced Search
MyIDEAS: Login to save this paper or follow this series

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem


Author Info

  • Klerk, E. de

    (Tilburg University)

  • Sotirov, R.

    (Tilburg University)


We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem library. Journal on Global Optimization, 10: 291–403, 1997]. AMS classification: 90C22, 20Cxx, 70-08.

(This abstract was borrowed from another version of this item.)

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Economists Online Support)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University in its series Open Access publications from Tilburg University with number urn:nbn:nl:ui:12-3125772.

as in new window
Date of creation: 2010
Date of revision:
Publication status: Published in Mathematical Programming (2010) v.122, p.225-246
Handle: RePEc:ner:tilbur:urn:nbn:nl:ui:12-3125772

Contact details of provider:
Web page:

Related research


Other versions of this item:

Find related papers by JEL classification:


References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Rendl, F. & Sotirov, R., 2007. "Bounds for the quadratic assignment problem using the bundle method," Open Access publications from Tilburg University urn:nbn:nl:ui:12-192934, Tilburg University.
  2. Ivanov, I.D. & Klerk, E. de, 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Klerk, E. de & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.
  2. Klerk, E. de & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
  3. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
  4. Laurent, M., 2009. "Sums of squares, moment matrices and optimization over polynomials," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3736413, Tilburg University.
  5. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:ner:tilbur:urn:nbn:nl:ui:12-3125772. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Economists Online Support).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.