龚金双, 李宗元. 有理系数整数线性规划的模式化算法[J]. 工程科学学报, 1991, 13(4): 393-398. DOI: 10.13374/j.issn1001-053x.1991.04.035
引用本文: 龚金双, 李宗元. 有理系数整数线性规划的模式化算法[J]. 工程科学学报, 1991, 13(4): 393-398. DOI: 10.13374/j.issn1001-053x.1991.04.035
Gong Jinshuang, Li Zongyuan. The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients[J]. Chinese Journal of Engineering, 1991, 13(4): 393-398. DOI: 10.13374/j.issn1001-053x.1991.04.035
Citation: Gong Jinshuang, Li Zongyuan. The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients[J]. Chinese Journal of Engineering, 1991, 13(4): 393-398. DOI: 10.13374/j.issn1001-053x.1991.04.035

有理系数整数线性规划的模式化算法

The Modelling Algorithm of Solving Integer Linear Programming of the Rational Coefficients

  • 摘要: 给出了有理系数整数线性规划的新的改进算法,称为模式化算法。其特点是:首先将此类规划变换(模式化)为一种特殊类型,然后利用其特殊结构建立改进算法。其综合了分枝定界法与割平面法,减少了分枝次数,简化了割平面的技巧。

     

    Abstract: A new algorithm of solving integer linear programming is introduced in which the coefficients of the objective function are rational. This algorithm is called the modelling algorithm. In this algorithm, first of all, it can transform (ILP) into a special programming, then solve the special programming using a kind of special algorithm. The basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.

     

/

返回文章
返回