On the assignment and transportation problems (abstract)
On the assignment and transportation problems (abstract)
复制标题
关于分配和交通问题(摘要)
DOI:
10.1002/nav.3800040112
复制
发表时间:
1957
期刊:
影响因子:
--
通讯作者:
J. Munkres
中科院分区:
文献类型:
--
作者:
J. Munkres
In this paper we presented an algorithm for the assignment problem which is a variant of H. W. Kuhn's so-called Hungarian method [11. We also gave a generalization of it to the transportation problem. Since a detailed exposition will appear elsewhere [23, we shall content ourselves here with a few general remarks. the cost matrix. In the Hungarian method and its variants, the general procedure is to transform the matrix by adding and subtracting constants from rows and columns of the matrix, until a matrix is obtained which contains zero elements in a certain crucial arrangement. In the process of determining what numbers to add and subtract, one needs to distinguish certain rows and columns, which are usually called covered rows or columns. One also needs to distinguish certain zero elements, usually done by means of asterisks (and primes, as well, in the present algorithm). tedious if carried out by hand. The Operations Research group, ERI, University of Michigan, has constructed a special-purpose computer to aid in this procedure. The author's algorithms were developed for use with this computer. each one capable of displaying any integer from 0 to 10. There is a telephone dial attached which is used to set up the matrix on the panel initially. Next to each row and column are push-buttons-pressing one button will cause each number in the corresponding row (or column) to be diminished by 1; pressing the other will cause each number in the row to be increased