基于主子阵算法的n-2n型指派计算工具的实现  

Implementation of Tool for n—2n Assignment Computing Based on Main Submatrix

作　　者：李冉[1] 周良泽[1] 

机构地区：[1]荆楚理工学院计算机工程学院,湖北荆门448000

出　　处：《数学的实践与认识》2014年第17期212-217,共6页Mathematics in Practice and Theory

基　　金：荆楚理工学院校级科研项目(指派计算工具的实现)

摘　　要：主要在研究周良泽的指派求解理论和主子阵算法基础上,设计一种n-2n指派问题求解的实现方案,最后用Java语言实现一个可视化的通用计算工具,并调试运行.结果证明,该实现方案效率高,结果易于理解.In this paper, a scheme of implementation to solve n - 2n assignment has been designed , based on the study of Zhou Liangze＇s assignment theory and the algorithm of main submatrix. Finally, a general visual computing tool has been achieved by using Java language. As it turned out, this scheme is high efficient, easy to understand.

关 键 词：指派问题 Liangze Zhou变换 主子阵算法 

分 类 号：O22[理学—运筹学与控制论]