Relaxations of combinatorial problems via association schemes

Autor: Pasechnik, D, de Klerk, E, de Oliveira Filho, FM, Anjos, MF, Lasserre, JB

Publikováno v: Handbook on Semidefinite, Conic and Polynomial Optimization, 171-200
STARTPAGE=171;ENDPAGE=200;TITLE=Handbook on Semidefinite, Conic and Polynomial Optimization

In this chapter we describe a novel way of deriving semidefinite programming relaxations of a wide class of combinatorial optimization problems. Many combinatorial optimization problems may be viewed as finding an induced subgraph of a specific type

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::22e09fc5fdf8d679212f41cf90d60eb6
https://research.tilburguniversity.edu/en/publications/adcc20b2-fd3f-4f6b-b4f8-89ef8ae2467d