SIA OpenIR  > 机器人学研究室
 非方阵指派问题的求解 Alternative Title The Solution for Assignment Problem of Nonsquare Matrix 杨丽英; 韩建达; 聂义勇 Department 机器人学研究室 Source Publication 信息与控制 ISSN 1002-0411 2009 Volume 38Issue:6Pages:641-645,652 Indexed By CSCD CSCD ID CSCD:3797070 Contribution Rank 1 Funding Organization 国家863计划资助项目(2007AA041502) Keyword 极大极小指派问题 总体极小指派问题 混合整数线性规划 矩阵作业法 行优先选取算法 Abstract 本文将2类方阵指派问题——极大极小和总体极小指派问题——的矩阵作业解法推广到非方阵情形,即求解任务与人员数目不等的指派问题,且维持矩阵作业法的效率.假定m>n,则按本文行优先选取算法求解m×n非方阵指派问题的最大逻辑运算量为O(mn2),其效率通常与执行一轮覆盖的矩阵作业法相当。 Other Abstract The operations on matrix for both minimax and global-minimum assignment problems of square matrix are applied to those of nonsquare matrix,namely,in the same efficiency with the operations on matrix,both the minimax and global-minimum assignment problems where number of people is unequal to number of tasks are solved. Supposed m > n,the quantity of logical operations to solve the assignment problem of m×n nonsquare matrix with the selection algorithm of precedence rows in this paper is not bigger than O(... Language 中文 Citation statistics Cited Times:1[CSCD]   [CSCD Record] Document Type 期刊论文 Identifier http://ir.sia.cn/handle/173321/2402 Collection 机器人学研究室 Corresponding Author 杨丽英 Affiliation 1.中国科学院沈阳自动化研究所机器人学国家重点实验室2.中国科学院研究生院 Recommended CitationGB/T 7714 杨丽英,韩建达,聂义勇. 非方阵指派问题的求解[J]. 信息与控制,2009,38(6):641-645,652. APA 杨丽英,韩建达,&聂义勇.(2009).非方阵指派问题的求解.信息与控制,38(6),641-645,652. MLA 杨丽英,et al."非方阵指派问题的求解".信息与控制 38.6(2009):641-645,652.