论文信息 - Quadratic Knapsack Relaxations Using Cutting Planes

Quadratic Knapsack Relaxations Using Cutting Planes

We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.

[1] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[2] Caterina De Simone,et al. The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[3] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[4] George L. Nemhauser,et al. Min-cut clustering , 1993, Math. Program..

[5] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[6] Franz Rendl,et al. Combining Semidefinite and Polyhedral Relaxations for Integer Programs , 1995, IPCO.

[7] Robert J. Vanderbei,et al. An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[8] Laurence A. Wolsey,et al. Formulations and valid inequalities for the node capacitated graph partitioning problem , 1996, Math. Program..

[9] Robert Weismantel,et al. On the 0/1 knapsack polytope , 1997, Math. Program..