Home > Research > Publications & Outputs > A new family of facet defining inequalities for...

Research

Associated organisational unit

Electronic data

  • Facet_Inequalities

    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

Links

Text available via DOI:

Keywords

View graph of relations

A new family of facet defining inequalities for the maximum edge-weighted clique problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A new family of facet defining inequalities for the maximum edge-weighted clique problem. / Djeumou Fomeni, Franklin.
In: Optimization Letters, Vol. 11, No. 1, 01.2017, p. 47-54.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Djeumou Fomeni, F 2017, 'A new family of facet defining inequalities for the maximum edge-weighted clique problem', Optimization Letters, vol. 11, no. 1, pp. 47-54. https://doi.org/10.1007/s11590-016-1055-z

APA

Djeumou Fomeni, F. (2017). A new family of facet defining inequalities for the maximum edge-weighted clique problem. Optimization Letters, 11(1), 47-54. https://doi.org/10.1007/s11590-016-1055-z

Vancouver

Djeumou Fomeni F. A new family of facet defining inequalities for the maximum edge-weighted clique problem. Optimization Letters. 2017 Jan;11(1):47-54. Epub 2016 Jun 22. doi: 10.1007/s11590-016-1055-z

Author

Djeumou Fomeni, Franklin. / A new family of facet defining inequalities for the maximum edge-weighted clique problem. In: Optimization Letters. 2017 ; Vol. 11, No. 1. pp. 47-54.

Bibtex

@article{4fbddd5631e24ac7abfb532abd05e738,
title = "A new family of facet defining inequalities for the maximum edge-weighted clique problem",
abstract = "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.",
keywords = "Edge-weighted clique problem, Cutting planes, Separation algorithm, Integer programming, Boolean quadric polytope, Facet defining inequalities",
author = "{Djeumou Fomeni}, Franklin",
year = "2017",
month = jan,
doi = "10.1007/s11590-016-1055-z",
language = "English",
volume = "11",
pages = "47--54",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "1",

}

RIS

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 -