SOLUTION OF THE ASSIGNMENT PROBLEM [H]

SOLUTION OF THE ASSIGNMENT PROBLEM [H]
复制标题

DOI:
10.1145/355873.355883
复制
发表时间:
1980-01-01
影响因子:
2.7
通讯作者:
TOTH, P
TOTH, P
中科院分区:
计算机科学3区
文献类型:
--
作者:
CARPANETO, G;TOTH, P

文献摘要

被引文献

相似文献

RH U第一(s)下(s)最后(s)作为分配给列(j—1.....的行n);作为列j的标号;ifLCj= 0, columnj是未标记的(]= 1.....n);作为第i行的标号;ifLR,= 0,第i行未标记(i= 1,…)n);作为转让成本;作为包含成本矩阵(I—1,…)第I行未赋值零元素对应的列的集合n);作为包含当前未完全探索行的集合;作为包含未分配行的集合;作为集合s的第一个元素;作为集合s中最后一个考虑的元素之后的元素;作为集合s和1978年10月23日的最后一个元素。允许免费复制本材料的全部或部分,前提是这些副本不是为了直接的商业利益而制作或分发的,必须出现ACM版权声明、出版物的标题和日期,并注明复制是由计算机协会的permmslon进行的。以其他方式复制或重新发布,需要付费和/或特定许可。
RH U first (s) next (s) last (s) as the row assigned to columny (j--1..... n); as the label of column j; ifLCj= 0, columnj is unlabeled (]= 1..... n); as the label of row i; ifLR,= 0, row i is unlabeled (i= 1,..., n); as the assignment cost; as the set containing the columns corresponding to the unassigned zero elements of row i of the cost matrix (i--1,..., n); as the set containing the current not-completely-explored rows; as the set containing the unassigned rows; as the first element of set s; as the element following the last considered element of set s; as the last element of set s.and 23 October 1978. Permismon to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice IS given that copying is by permmslon of the Association for Computmg Machinery. To copy otherwise, or to republish, requires a fee and/or specific permlssion.