On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)

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

Research output: Working paperDiscussion paperOther research output

217 Downloads (Pure)

Abstract

AMS classification: 90C22, 20Cxx, 70-08
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages20
Volume2007-101
Publication statusPublished - 2007

Publication series

NameCentER Discussion Paper
Volume2007-101

Keywords

  • traveling salesman problem
  • semidefinite programming
  • quadratic as- signment problem

Fingerprint Dive into the research topics of 'On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)'. Together they form a unique fingerprint.

  • Cite this

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