Algorithms and codes for dense assignment problems: The state of the art

Discrete Applied Mathematics

Volumn 100, Issue 1-2, 2000, Pages 17-48

  Dell'Amico, Mauro ^a   Toth, Paolo ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Comparison of algorithms; Dense matrices; Experimental evaluation; Linear assignment problem

Indexed keywords

EID: 0347306743     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00172-9     Document Type: Article

References (55)

1. Ahuja R.K., Orlin J.B. The scaling network simplex algorithm. Oper. Res. (Suppl. 1):1992;S5-S13.
2. Akgül M. A sequential dual simplex algorithm for the linear assignment problem. Oper. Res. Lett. 7:1988;155-158.
3. Akgül M. Erratum. A sequential dual simplex algorithm for the linear assignment problem. Oper. Res. Lett. 8:1989;117.
4. M. Akgül, The linear assignment problem, in: M. Akgül, H.W. Hamacher, S. Tüfekçi (Eds.), Combinatorial Optimization NATO ASI Series F, vol. 82, Springer, Berlin, 1992, pp. 85-122.
5. Akgül M. A genuinely polynomial primal simplex algorithm for the assignment problem. Discr. Appl. Math. 45:1993;93-115.
6. P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem, Tech. Rep. RR949-M, IMAG, Grenoble, France, 1995.
7. Balas E., Miller D., Pekny J., Toth P. A parallel augmenting shortest path algorithm for the assignment problem. J. ACM. 38:1991;985-1004.
8. Balinski M.L. The Hirsch conjecture for dual transportation polyhedra. Math. Oper. Res. 9:1984;629-633.
9. Balinski M.L. Signature methods for the assignment problem. Oper. Res. 33:1985;527-536.
10. Balinski M.L. A competitive (dual) simplex method for the assignment problem. Math. Program. 34:1986;125-141.
11. Barr R.S., Glover F., Klingman D. The alternating basis algorithm for assignment problems. Math. Program. 13:1977;1-13.
12. Beasley J.E. Linear programming on Cray supercomputers. J. Oper. Res. Soc. 41:1990;133-139.
13. Beasley J.E. Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41:1990;1069-1072.
14. Bertsekas D.P. A new algorithm for the assignment problem. Math. Program. 21:1981;152-171.
15. D.P. Bertsekas, Linear Network Optimization: Algorithms and Codes, The MIT Press, Cambridge, MA, 1991.
16. Bertsekas D.P., Eckstein J. Dual coordinate step methods for linear network flow problems. Math. Program. 42:1988;203-243.
17. Bertsekas D.P., Castañon D.A. Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17:1991;707-732.
18. R.E. Burkard, U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRAN Programs, Springer, Berlin, 1980. R.E. Burkard, E. Cela, Linear assignment and extensions, Tech. Rep. 127, Institut für Mathematik, Technische Universität Graz (1998) .
19. R.E. Burkard, U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRAN Programs, Springer, Berlin, 1980. R.E. Burkard, E. Cela, Linear assignment and extensions, Tech. Rep. 127, Institut für Mathematik, Technische Universität Graz (1998) .
20. Carpaneto G., Dell'Amico M., Toth P. Exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans. Math. Software. 21:1995;394-409.
21. G. Carpaneto, S. Martello, P. Toth, Algorithms and codes for the assignment problem, in: B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (Eds.), Fortran Codes for Network Optimization, Ann. Oper. Res., Vol. 13, Baltzer, Basel, 1988, pp. 193-223.
22. Carpaneto G., Toth P. Solution of the assignment problem. ACM, Trans. Math. Software. 6:1980;104-111.
23. Carpaneto G., Toth P. Primal-dual algorithms for the assignment problem. Discrete Appl. Math. 18:1987;137-153.
24. D.A. Castañon, Reverse auction algorithms for assignment problems, in: D.S. Johnson, C.C. McGeoch (Eds.), Network Flows and Matching: First DIMACS Implementation Challenge, American Mathematical Society, Providence, RI, 1993, pp. 407-430.
25. Christofides N., Eilon S. An Algorithm for the vehicle dispatching problem. Oper. Res. Quart. 20:1969;309-318.
26. N. Christofides, A. Mingozzi, P. Toth, The vehicle routing problem, in: N. Christofides, A. Mingozzi, P. Toth, C. Sandi (Eds.), Combinatorial Optimization, Wiley, Chichester, 1979, pp. 318-338.
27. Cunningham W.H. A network simplex method. Math. Program. 11:1976;105-116.
28. Dell'Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Manage. Sci. 39:1993;115-125.
29. M. Dell'Amico, S. Martello, Linear assignment, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 355-371.
30. U. Derigs, The shortest augmenting path method for solving assignment problems - motivation and computational experience, in: C.L. Monma, (Ed.), Algorithms and Software for Optimization - Part I, Ann. Oper. Res., Vol. 4, Baltzer, Basel, 1985, pp. 57-102.
31. Fisher M. Optimal solution of vehicle routing problem using minimum. k -trees Oper. Res. 42(4):1994;626-642.
32. Goldberg A.V., Kennedy R. An efficient cost scaling algorithm for the assignment problem. Math. Program. 71:1995;153-177.
33. Goldberg A.V., Plotkin S.A., Vaidya P. Sublinear-time parallel algorithms for matching and related problemst. J. Algorithms. 14:1993;180-213.
34. Goldberg A.V., Tarjan R.E. Finding minimum-cost circulation by successive approximation. Math. Oper. Res. 15:1990;430-466.
35. Hung M.S. A polynomial simplex method for the assignment problem. Oper. Res. 31:1983;595-600.
36. D.S. Johnson, C.C. McGeoch (Eds.), Network Flows and Matching: First DIMACS Implementation Challenge, American Mathematical Society, Providence, RI, 1993.
37. Jonker R., Volgenant A. Improving the Hungarian assignment algorithm. Oper. Res. Lett. 5:1986;171-175.
38. Jonker R., Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing. 38:1987;325-340.
39. Kennington J.L., Wang Z. An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA J. Comput. 3:1991;299-306.
40. Kuhn H.W. The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 2:1955;83-97.
41. Kuhn H.W. Variants of The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 3:1956;253-258.
42. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
43. Machol R.E., Wien M. A hard assignment problem. Oper. Res. 24:1976;190-192.
44. Machol R.E., Wien M. Errata. Oper. Res. 24:1977;364.
45. S. Martello, P. Toth, Linear assignment problems, in: S. Martello, G. Laporte, M. Minoux, C. Ribeiro, (Eds.), Surveys in Combinatorial Optimization, Annals of Discrete. Mathematics, Vol. 31, North-Holland, Amsterdam, 1987, pp. 259-282.
46. McGinnis L.F. Implementation and testing of a primal-dual algorithm for the assignment problem. Oper. Res. 31:1983;277-299.
47. Orlin J.B. On the simplex algorithm for networks and generalized networks. Math. Program. Stud. 24:1985;166-178.
48. Orlin J.B., Ahuja R.K. New scaling algorithms for the assignment and minimum cycle mean problems. Math. Program. 54:1992;41-56.
49. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
50. K.G. Ramakrishnan, N.K. Karmarkar, A.P. Kamath, An approximate dual projective algorithm for solving assignment problems, in: D.S. Johnson, C.C. McGeoch (Eds.), Network Flows and Matching: First DIMACS Implementation Challenge, American Mathematical Society, Providence, RI, 1993, pp. 431-452.
51. Reinelt G. Tsplib - A travelling salesman problem library. ORSA J. Comput. 4:1991;376-384.
52. Schwartz B.L. A computational analysis of the auction algorithm. European. J. Oper. Res. 42:1994;161-169.
53. B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallottino (Eds.), Fortran Codes for Network Optimization, Annals of Operation Research, Vol. 13, Baltzer, Basel, 1988.
54. Volgenant A. Linear and semi-assignment problems: a core oriented approach. Comput. Oper. Res. 23:1996;917-932.
55. Zaki H. A comparison of two algorithms for the assignment problem. Comput. Opt. Appl. 41:1995;23-45.