[1] |
Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974. · Zbl 0326.68005 |
[2] |
Barr, R. S., Glover, F., Klingman, D.: The alternating basis algorithm for assignment problems. Mathematical Programming13, 1–13 (1977). · Zbl 0378.90097 · doi:10.1007/BF01584319 |
[3] |
Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with FORTRAN-programs, pp. 1–11. Berlin-Heidelberg-New York: Springer 1980. · Zbl 0436.90069 |
[4] |
Carpaneto, G., Toth, P.: Algorithm 548 (solution of the assignment problem). ACM Trans. on Mathematical Software6, 104–111 (1980). · Zbl 0445.90089 · doi:10.1145/355873.355883 |
[5] |
Carpaneto, G., Martello, S., Toth, P.: Il problema dell’assegnamento. Tech. Rep. 13. 81, SOFMAT, Progetto Finalizzato Informatica del CNR, Roma (1981). |
[6] |
Kuhn, N. W.: The hungarian method for the assignment problem. Naval Res. Logist. Quart.2, 83–97 (1955). · Zbl 0143.41905 · doi:10.1002/nav.3800020109 |
[7] |
Lawler, E.: Combinatorial optimization: networks and matroids, pp. 201–207. New York: Holt, Rinehart and Wilson 1976. · Zbl 0413.90040 |