Home > Research > Publications & Outputs > Gap inequalities for non-convex mixed-integer q...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Gap inequalities for non-convex mixed-integer quadratic programs

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

Published

Standard

Gap inequalities for non-convex mixed-integer quadratic programs. / Galli, Laura; Kaparis, Konstantinos; Letchford, A N.
In: Operations Research Letters, Vol. 39, No. 5, 2011, p. 297-300.

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

Harvard

Galli, L, Kaparis, K & Letchford, AN 2011, 'Gap inequalities for non-convex mixed-integer quadratic programs', Operations Research Letters, vol. 39, no. 5, pp. 297-300. https://doi.org/10.1016/j.orl.2011.07.002

APA

Galli, L., Kaparis, K., & Letchford, A. N. (2011). Gap inequalities for non-convex mixed-integer quadratic programs. Operations Research Letters, 39(5), 297-300. https://doi.org/10.1016/j.orl.2011.07.002

Vancouver

Galli L, Kaparis K, Letchford AN. Gap inequalities for non-convex mixed-integer quadratic programs. Operations Research Letters. 2011;39(5):297-300. doi: 10.1016/j.orl.2011.07.002

Author

Galli, Laura ; Kaparis, Konstantinos ; Letchford, A N. / Gap inequalities for non-convex mixed-integer quadratic programs. In: Operations Research Letters. 2011 ; Vol. 39, No. 5. pp. 297-300.

Bibtex

@article{d81ee99ad2bc4eacb9cc5737d8bf059e,
title = "Gap inequalities for non-convex mixed-integer quadratic programs",
abstract = "Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.",
keywords = "max-cut problem, mixed-integer nonlinear programming, polyhedral combinatorics",
author = "Laura Galli and Konstantinos Kaparis and Letchford, {A N}",
year = "2011",
doi = "10.1016/j.orl.2011.07.002",
language = "English",
volume = "39",
pages = "297--300",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "5",

}

RIS

TY - JOUR

T1 - Gap inequalities for non-convex mixed-integer quadratic programs

AU - Galli, Laura

AU - Kaparis, Konstantinos

AU - Letchford, A N

PY - 2011

Y1 - 2011

N2 - Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.

AB - Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.

KW - max-cut problem

KW - mixed-integer nonlinear programming

KW - polyhedral combinatorics

U2 - 10.1016/j.orl.2011.07.002

DO - 10.1016/j.orl.2011.07.002

M3 - Journal article

VL - 39

SP - 297

EP - 300

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -