%0 Journal Article
%T A BOUNDING TECHNIQUE FOR LINEARLY CONSTRAINED 0-1 QUADRATIC PROGRAMMING<br>线性约束0-1 二次规划的一个定界技术
%A Wen Xing ZHU
%A <br>朱文兴
%A 张连生
%J 系统科学与数学
%D 1999
%I 
%X 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).
%K 0-1 Quadratic programming
%K lower bounding
%K convex quadratic programming<br>0－1二次规划
%K 定界
%K 凸二次规划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=882EBA23DEA94B19&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=CA4FD0336C81A37A&sid=457934BE093FCE13&eid=A68B4EE6F4C90B8C&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0