A SURROGATE CONSTRAINT BOUNDING APPROACH TO MIXED 0-1 LINEAR PROGRAMMING PROBLEMS
混合 0-1 线性规划问题的一个代理约束定界方法

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.