Comparison of Convez Relazations of Quadrilinear Terms
In this paper we compare four different ways to compute a convex linear relaxation of a quadrilinear monomial on a box. Analyzing their relative tightness. We computationally compare the quality of the relaxations, and we provide a general theorem on painvise-comparison of relaxation strength, which applies to some of our pairs of relaxations for quadrilinear monomials. Our results can be used to configure a spatial Branch-and-Bound global optimization algorithm. We apply our results to the Molecular Distance Geometry Problem, demonstrating the usefulness of the present study.
Sonia Cafieri Jon Lee Leo Liberti
LIX, Ecole Polytechnique, 91128 Palaiseau, France IBM T.J. Watson Research Center, Yorktown Heights, N. Y, USA
国际会议
The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)
长沙
英文
999-1005
2009-06-01（万方平台首次上网日期，不代表论文的发表时间）