摘要
分配问题是一个组合优化问题。传统计算机求解分配问题的方法中，既有枚举法、最小元素法、行（列）扫描法和损益分析等算法，也有如分枝限界法、匈牙利算法及其改进算法。本文在对这些计算机方法进行分析和仿真的基础上，将一个随机并行算法用在解决分配问题上，并且对各种方法的运行结果进行了比较。
The assignment problem is a kind of combinatorial optimization problems. There are many computer methods to the problem, such as enumeration,minimum cell, line (column) scan,increase and decrease analyses, branch and bound, Hungarian and its modified algorithm, etc..On the basis of analysing, summarizing and simulating these traditional methods, we use a stochastic parallel algorithm to solve the assignment problem, and compare them in time complexity and result.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1995年第6期29-34,共6页
Journal of Computer Research and Development
关键词
分配问题
组合优化
随机并行算法
计算机
Assignment problem, combinatorial optimization, stochastic parallel algorithm.
