ACM Home Page
Please provide us with feedback. Feedback
An algorithm for the assignment problem
Full text PdfPdf (231 KB)
Source
Communications of the ACM archive
Volume 3 ,  Issue 11  (November 1960) table of contents
Pages: 605 - 606  
Year of Publication: 1960
ISSN:0001-0782
Author
Roland Silver  Massachusetts Institute of Technology, Cambridge
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 56,   Citation Count: 5
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/367436.367476
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DANTZIG, G. B., Application of the Simplex Method to a Transportation Problem. Activity Analysis of Production and Allocation, Chap. 23, Cowles Commission Monograph No. 13 New York, 1951.
 
2
MUNKRES, J., Algorithms for the assignment and transportation problems. J. Soc. Indust. Appl. Math. 5(1957), 32-38
 
3
FORD, L. R., JR., aND FULKERSOX, D. R., A simple algorithm for finding maximal network flows and an application to the Hiteheoek Problem. Rand Paper P-743, 29 December 1955.