Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s11590-016-1055-z
Accepted author manuscript, 317 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - A new family of facet defining inequalities for the maximum edge-weighted clique problem
AU - Djeumou Fomeni, Franklin
PY - 2017/1
Y1 - 2017/1
N2 - 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.
AB - 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.
KW - Edge-weighted clique problem
KW - Cutting planes
KW - Separation algorithm
KW - Integer programming
KW - Boolean quadric polytope
KW - Facet defining inequalities
U2 - 10.1007/s11590-016-1055-z
DO - 10.1007/s11590-016-1055-z
M3 - Journal article
VL - 11
SP - 47
EP - 54
JO - Optimization Letters
JF - Optimization Letters
SN - 1862-4472
IS - 1
ER -