Giorgio Carpaneto
References
- 1 BARR, R.S. Streanding primal simplex transportatlon codes. Res. Rep., Center for Cybernetic Studies, U. of Texas, Austin, Tex. To appear.Google Scholar
- 2 BARR, R.S., GLOVER, F., AND KLINGMAN, D. The alternating basis algorithm for assignment problems. Math. Programming 13 (1977), 1-13.Google Scholar
- 3 BOURGP.OIS, F., AND LASSALLE, J.C. An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Comm. ACM 14, 12 {Dec. 1971), 802-804.
Google Scholar - 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.Google Scholar
- 5 CHI~ISTOFIDES, N. Graph Theory. An Algorithmzc Approach. Academic Press, London, 1975.
Google Scholar - 6 HATCH, R.S. Optimization strategies for large scale assignment and transportation type problems. ORSA/TIMS Conf., San Juan, Puerto Rico, 1974.Google Scholar
ASSCT (548.gz)the square assignment problem. Gams: G2b
Supplemental Material
Available for Download
Index Terms
Algorithm 548: Solution of the Assignment Problem [H]
Comments