Algorithm 548: Solution of the Assignment Problem [H]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 548: Solution of the Assignment Problem [H]

Full text

Pdf (357 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 1 (March 1980) table of contents

Pages: 104 - 111

Year of Publication: 1980

ISSN:0098-3500

Authors

Giorgio Carpaneto	Istituto di Automatica, Facoltà di Ingegneria, Universita Di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Paolo Toth	Istituto di Automatica, Facoltà di Ingegneria, Universita Di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 83, Citation Count: 6

Additional Information:

appendices and supplements references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355873.355883 What is a DOI?

APPENDICES and SUPPLEMENTS

ASSCT (548.gz) (2 KB)

the square assignment problem.
Gams: G2b

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	BARR, R.S. Streanding primal simplex transportatlon codes. Res. Rep., Center for Cybernetic Studies, U. of Texas, Austin, Tex. To appear.
	2	BARR, R.S., GLOVER, F., AND KLINGMAN, D. The alternating basis algorithm for assignment problems. Math. Programming 13 (1977), 1-13.
	3	François Bourgeois , Jean-Claude Lassalle, An extension of the Munkres algorithm for the assignment problem to rectangular matrices, Communications of the ACM, v.14 n.12, p.802-804, Dec. 1971 [doi>10.1145/362919.362945]
	4	CARPANETO, G., AND TOTH, P. An efficient algorithm for the assignment problem. Tech. Rep. 39, Istituto di Autornatica, U. of Bologna, Bologna, Italy, 1976.
	5	Nicos Christofides, Graph theory: An algorithmic approach (Computer science and applied mathematics), Academic Press, Inc., Orlando, FL, 1975
	6	HATCH, R.S. Optimization strategies for large scale assignment and transportation type problems. ORSA/TIMS Conf., San Juan, Puerto Rico, 1974.

CITED BY 6

	N. P. Chrisochoides , E. N. Houstis , C. E. Houstis, Geometry based mapping strategies for PDE computations, Proceedings of the 5th international conference on Supercomputing, p.115-127, June 17-21, 1991, Cologne, West Germany
	I. Nikolaidis , I. Akyildiz, A cell loss equalization protocol for video multiplexers, Proceedings of the second ACM international conference on Multimedia, p.255-262, October 15-20, 1994, San Francisco, California, United States
	Liang Chen , Naoyuki Tokuda, n-Tokyoites' loop-line commuter problem, Discrete Mathematics, v.269 n.1-3, p.81-91, 28 July 2003
	El-Ghazali Talbi , Benjamin Weinberg, Breaking the search space symmetry in partitioning problems, Theoretical Computer Science, v.378 n.1, p.78-86, June, 2007
	George Ioannou, An integrated model and a decomposition-based approach for concurrent layout and material handling system design, Computers and Industrial Engineering, v.52 n.4, p.459-485, May, 2007
	Agostino Nobile , Alastair T. Fearnside, Bayesian finite mixtures with an unknown number of components: The allocation sampler, Statistics and Computing, v.17 n.2, p.147-162, June 2007