On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)

E. de Klerk, D.V. Pasechnik, R. Sotirov

Research output: Working paperDiscussion paperOther research output

271 Downloads (Pure)

Abstract

AMS classification: 90C22, 20Cxx, 70-08
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages19
Volume2008-96
Publication statusPublished - 2008

Publication series

NameCentER Discussion Paper
Volume2008-96

Keywords

  • traveling salesman problem
  • semidefinite programming
  • quadratic assignment problem
  • association schemes

Fingerprint Dive into the research topics of 'On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)'. Together they form a unique fingerprint.

  • Cite this

    de Klerk, E., Pasechnik, D. V., & Sotirov, R. (2008). On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101). (CentER Discussion Paper; Vol. 2008-96). Operations research.