SOLUTION OF THE ASSIGNMENT PROBLEM [H]
SOLUTION OF THE ASSIGNMENT PROBLEM [H]
复制标题
DOI:
10.1145/355873.355883
复制
发表时间:
1980-01-01
影响因子:
2.7
通讯作者:
TOTH, P
中科院分区:
文献类型:
--
作者:
CARPANETO, G;TOTH, P
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.