A BOUNDING TECHNIQUE FOR LINEARLY CONSTRAINED 0-1 QUADRATIC PROGRAMMING
线性约束0-1 二次规划的一个定界技术

Taking into account the idea of McBride and Yormark (1980) and a lower bounding method in global optimization, a lower bounding technique is presented in this paper for linearly constrained 0-1 quadratic programming problems, which could in turn be incorporated into the Branch-and-Bound scheme. The lower bound provided is proved to be better than that of McBride and Yormark (1980).