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

Semidefinite Programming Relaxation
Association Scheme
Combinatorial Optimization Problem

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). Tilburg: Operations research.
@techreport{3b5033a498bc4969aa57df4c6bf004ec,
title = "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems",
abstract = "AMS classification: 90C22, 20Cxx, 70-08",
keywords = "traveling salesman problem, maximum bisection, semidefinite programming, association schemes",
author = "{de Klerk}, E. and D.V. Pasechnik",
note = "Pagination: 20",
year = "2009",
language = "English",
volume = "2009-54",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

de Klerk, E & Pasechnik, DV 2009 'On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems' CentER Discussion Paper, vol. 2009-54, Operations research, Tilburg.

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems. / de Klerk, E.; Pasechnik, D.V.

Tilburg : Operations research, 2009. (CentER Discussion Paper; Vol. 2009-54).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

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

AU - de Klerk, E.

AU - Pasechnik, D.V.

N1 - Pagination: 20

PY - 2009

Y1 - 2009

N2 - AMS classification: 90C22, 20Cxx, 70-08

AB - AMS classification: 90C22, 20Cxx, 70-08

KW - traveling salesman problem

KW - maximum bisection

KW - semidefinite programming

KW - association schemes

M3 - Discussion paper

VL - 2009-54

T3 - CentER Discussion Paper

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

PB - Operations research

CY - Tilburg

ER -