Semidefinite programs and association schemes

We consider semidefinite programs, where all the matrices defining the problem commute. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.

MoreLess

Year of publication:	1999-11-01
Authors:	GOEMANS, Michel ; RENDL, Franz
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	semideﬁnite programming \| association scheme \| maximum cut problem

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	CORE Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series UNIVERSITE CATHOLIQUE DE LOUVAIN, Center for Operations Research and Econometrics (CORE) Number 1999062
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005008498