On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

E. de Klerk, D.V. Pasechnik

Research output: Working paperDiscussion paperOther research output

232 Downloads (Pure)

Abstract

AMS classification: 90C22, 20Cxx, 70-08
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages20
Volume2009-54
Publication statusPublished - 2009

Publication series

NameCentER Discussion Paper
Volume2009-54

    Fingerprint

Keywords

  • traveling salesman problem
  • maximum bisection
  • semidefinite programming
  • association schemes

Cite this

de Klerk, E., & Pasechnik, D. V. (2009). On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems. (CentER Discussion Paper; Vol. 2009-54). Operations research.