摘要
本文给出混合０－１线性规划问题的一个代理约束定界方法，利用代理约束构造一个定界函数，计算量较小，并提出一个分支定界算法，数值计算表明算法是有效的．
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.
出处
《系统科学与数学》
CSCD
北大核心
1999年第3期341-347,共7页
Journal of Systems Science and Mathematical Sciences
