Semidefinite programming in combinatorial optimization

被引:0
作者
Michel X. Goemans
机构
[1] MIT,Department of Mathematics
来源
Mathematical Programming | 1997年 / 79卷
关键词
Semidefinite programming; Combinatorial optimization; Stable set; Maximum cut; Coding theory;
D O I
暂无
中图分类号
学科分类号
摘要
We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem.
引用
收藏
页码:143 / 161
页数:18
相关论文
共 50 条