%0 Journal Article
%T A SURROGATE CONSTRAINT BOUNDING APPROACH TO MIXED 0-1 LINEAR PROGRAMMING PROBLEMS<br>混合 0-1 线性规划问题的一个代理约束定界方法
%A Ni Mingfang
%A Li Qi
%A <br>倪明放
%A 李奇
%J 系统科学与数学
%D 1999
%I 
%X A surrogate constraint bounding approach to mired 0-l linear programmingis introduced in this paper. A bounding function is constructed by the use of the surrogateconstraint with less computational time, and a branch and bound algorithm is presented. Thenumerical results show that the algorithm is efficient.
%K Mixed 0-1 linear program
%K surrogate constraint
%K branch and bound algorithm<br>混合0－1线性规划
%K 代理约束
%K 分支定界算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=16E1673C72EF4541&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=38B194292C032A66&sid=4B168891B5E5FB30&eid=15251AE9C02726D3&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=3