A new family of facet defining inequalities for the maximum edge-weighted clique problem
详细信息 查看全文
- 作者：Franklin Djeumou Fomeni
- 关键词：Edge ; weighted clique problem ; Cutting planes ; Separation algorithm ; Integer programming ; Boolean quadric polytope ; Facet defining inequalities
- 刊名：Optimization Letters
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：11
- 期：1
- 页码：47-54
- 全文大小：
- 刊物类别：Mathematics and Statistics
- 刊物主题：Optimization; Operation Research/Decision Theory; Computational Intelligence; Numerical and Computational Physics, Simulation;
- 出版者：Springer Berlin Heidelberg
- ISSN：1862-4480
- 卷排序：11
文摘
This paper considers a family of cutting planes, recently developed for mixed 0–1 polynomial programs and shows that they define facets for the maximum edge-weighted clique problem. There exists a polynomial time exact separation algorithm for these inequalities. The result of this paper may contribute to the development of more efficient algorithms for the maximum edge-weighted clique problem that use cutting planes.