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

Etienne de Klerk and D.V. Pasechnik
Additional contact information
D.V. Pasechnik: Tilburg University, Center For Economic Research

No 2009-54, Discussion Paper from Tilburg University, Center for Economic Research

Keywords: traveling salesman problem; maximum bisection; semidefinite programming; association schemes (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://repository.tilburguniversity.edu/bitstream ... 1b05b2e8f23/download (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tiu:tiucen:3b5033a4-98bc-4969-aa57-df4c6bf004ec

Access Statistics for this paper

More papers in Discussion Paper from Tilburg University, Center for Economic Research
Bibliographic data for series maintained by Richard Broekman ().