research

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

Authors: E. de Klerk
D.V. Pasechnik
Publication date
Publisher

Abstract

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association schemes

Similar works

Full text

thumbnail-image

Open in the Core reader

Available Versions

Research Papers in Economics

redirect

Last time updated on 06/07/2012