ACM Home Page
Please provide us with feedback. Feedback
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Full text PdfPdf (253 KB)
Source
Communications of the ACM archive
Volume 14 ,  Issue 12  (December 1971) table of contents
Pages: 802 - 804  
Year of Publication: 1971
ISSN:0001-0782
Authors
François Bourgeois  CERN, Geneva, Switzerland
Jean-Claude Lassalle  CERN, Geneva, Switzerland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 34,   Downloads (12 Months): 157,   Citation Count: 17
Additional Information:

abstract   references   cited by   index terms   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/362919.362945
What is a DOI?

ABSTRACT

The assignment problem, together with Munkres proposed algorithm for its solution in square matrices, is presented first. Then the authors develop an extension of this algorithm which permits a solution for rectangular matrices. Timing results obtained by using an adapted version of Silver's Algol procedure are discussed, and a relation between solution time and problem size is given.


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
Bourgeois, F., Grote, H., and Lassalle, J.C. Pattern recognition methods for Omega and SFM Spark Chamber experiments. CERN-Data Handling Division DD/DH/70/13, Geneva, Switzerland, Mar. 1970.
 
2
Munkres, J. Algorithms for the assignment and transportation Problems. J. Siam 5 (Mar. 1957), 32-38.
3
 
4
Berge, C. Thdorie des Graphes et ses Applications. Dunod, Paris, 1958.
 
5
Kaufmann, A. Introduction ~ la Combinatorique en Vue de ses Applications. Dunod, Paris, 1968, pp. 506-515.

CITED BY  17

Collaborative Colleagues:
François Bourgeois: colleagues
Jean-Claude Lassalle: colleagues