摘要
本文提出一种求解一类（０，１）规划问题的高效启发式算法—相对差商法，其组合次数不大于设计变量的个数，可以用来迅速地求解任意规模的问题，并且本文还给出了该算法的误差估计及解的修正算法。
A high efficient heuristic algorithm, relative difference quotient algorithm, is advanced in this paper. The combinations of the algorithm proposed here isnot more than the design variables, so that it can be used to solve large scale problems rapidly. The error estimation and the method for improving the accuracy of solution are recommended as well.
出处
《系统工程学报》
CSCD
1996年第1期17-27,共11页
Journal of Systems Engineering
基金
山东省自然科学基金
关键词
(0
1)规划
启发式算法
相对差商法
线性规划
programming, approximate computation, error estimation,heuristic algorithm
