摘要
0-1规划中,当变量较大时,状态数过多、时间耗费较大,隐枚举法是目前解决0-1规划问题最有效的方法,并行计算的特点是快速解决大型且复杂的计算问题。结合并行计算和隐枚举法来解决这个问题,并且对隐枚举法做了一定的改进,使得在串行计算中难以实现的问题在并行计算机上得到了解决,并用实例验证了算法的可行性和优越性。
In 0-1programming,the more the variables are,the more the states are and the longer the time costs.At present,implicit enumeration method is the best way to solve it.According to the characteristic of parallel computing,it can solve big and complex problems fast.A method combining the parallel computing with the implicit enumeration is presented in this paper to resolve the problem mentioned above.And,there is some improvement made on the implicit enumeration,so the problem which is hard to serial computing can be solved by parallel computers.An example is given for the proof of the feasibility and predominance of the algorithm.
出处
《计算机应用与软件》
CSCD
2010年第7期268-269,289,共3页
Computer Applications and Software
关键词
0-1规划
并行计算
隐枚举法
0-1programming Parallel computing Implicit enumeration method
