Relaxations of combinatorial problems via association schemes

  • Etienne de Klerk
  • Fernando Mário de Oliveira Filho
  • Dmitrii V. Pasechnik
    • Categories Combinatorial Optimization, Semi-definite Programming Tags , Short URL: https://optimization-online.org/?p=11216

    In this chapter we study a class of semidefinite programming relaxations of combinatorial problems. These relaxations are derived using the theory of coherent configurations in algebraic combinatorics.

    Citation

    Draft version of a chapter for "Handbook on SDP II" (M. Anjos and J. Lasserre, eds.), Springer.

    Article

    Download

    View Relaxations of combinatorial problems via association schemes