Galli, Laura and Kaparis, Konstantinos and Letchford, A N (2011) Gap inequalities for non-convex mixed-integer quadratic programs. Operations Research Letters, 39 (5). pp. 297-300. ISSN 0167-6377Full text not available from this repository.
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.
|Journal or Publication Title:||Operations Research Letters|
|Uncontrolled Keywords:||max-cut problem ; mixed-integer nonlinear programming ; polyhedral combinatorics|
|Subjects:||H Social Sciences > HB Economic Theory|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||07 Sep 2011 15:13|
|Last Modified:||25 Apr 2017 04:17|
Actions (login required)