摘要
针对0-1整数规划中的传统指派问题,由工程实践问题提出了一种全新的解法——目标值子矩阵法.对于n个变量的传统指派问题,一般只需n次运算即可找到最优解,简单易懂,与全枚解法和其他隐枚解法相比,极大地降低了计算量.如果把这种方法应用在计算机中,将使编程简化,计算次数减少,运算速度大为提高.
Target value sub matrix method is put forward to solve tradition assignment problem of 0-1 integer plan.Traditional assignment problem of n variable requires n times of operation to find the optimum solution,simple lucid.Compared with entire enumeration method and other hidden enumeration method,target value sub matrix method extremely reduces computation.If this method is applied to the computer,the computer program will be simplified,the number of times of calculation will be reduced,and the arithmetic speed will be improved rapidly.
出处
《浙江大学学报(理学版)》
CAS
CSCD
北大核心
2010年第5期501-504,共4页
Journal of Zhejiang University(Science Edition)
基金
北华大学博士启动基金
关键词
传统指派问题
目标值子矩阵法
计算量
tradition assignment problem
target value sub matrix method
computation