Optimization Online


Relaxations of combinatorial problems via association schemes

Etienne De Klerk(e.deklerk***at***uvt.nl)
Fernando, M. De Oliveira Filho(f.m.deoliveirafilho***at***uvt.nl)
Dmitrii, V. Pasechnik(dima***at***ntu.edu.sg)

Abstract: 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.

Keywords: semidefinite programming, coherent configurations

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Combinatorial Optimization

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

Download: [PDF]

Entry Submitted: 07/27/2010
Entry Accepted: 07/27/2010
Entry Last Modified: 07/27/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society