Skip to main content
SpringerLink
Log in

Semidefinite Programs and Association Schemes

  • Published:
Computing Aims and scope Submit manuscript

Abstract.

We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. B-1348 Louvain-La-Neuve, Belgium, e-mail: goemans@math.mit.edu , BE

    M. X. Goemans

  2. Universität Klagenfurt, Institut für Mathematik, A-9020 Klagenfurt, Austria, e-mail: franz.rendl@uni-klu.ac.at , AT

    F. Rendl

Authors
  1. M. X. Goemans
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Rendl
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: November 26, 1998; revised July 20, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goemans, M., Rendl, F. Semidefinite Programs and Association Schemes. Computing 63, 331–340 (1999). https://doi.org/10.1007/s006070050038

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070050038

Search

Navigation