Local search heuristics for the multidimensional assignment problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5420 LNCS, Issue , 2009, Pages 100-115

  Gutin, G ^a   Karapetyan, D ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; COMPUTATIONAL EXPERIMENT; LOCAL SEARCH HEURISTICS; MULTIDIMENSIONAL ASSIGNMENT PROBLEM; RUNNING TIME; SOLUTION QUALITY;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

TRAVELING SALESMAN PROBLEM;

EID: 70249106080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02029-2_10     Document Type: Conference Paper

References (15)

1. Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: Grasp with path relinking for three-index assignment. INFORMS J. on Computing 17(2), 224-247 (2005)
2. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley, Chichester (2000)
3. Balas, E., Saltzman, M.J.: An algorithm for the three-index assignment problem. Oper. Res. 39(1), 150-161 (1991)
4. Bekker, H., Braad, E.P., Goldengorin, B.: Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.3483, pp. 397-406. Springer, Heidelberg (2005) (Pubitemid 41313439)
5. Burkard, R.E., Ç ela, E.: Linear assignment problems and extensions. In: Du, Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, Dordrecht, pp. 75-149 (1999)
6. Crama, Y., Spieksma, F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European Journal of Operational Research 60(3), 273-279 (1992)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman, New York (1979)
8. Grundel, D., Oliveira, C., Pardalos, P.: Asymptotic properties of random multidimensional assignment problems. Journal of Optimization Theory and Applications 122(3), 33-46 (2004)
9. Grundel, D.A., Pardalos, P.M.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl. 30(2), 133-146 (2005)
10. Huang, G., Lim, A.: A hybrid genetic algorithm for the three-index assignment problem. European Journal of Operational Research 127(1), 249-257 (2006)
11. Knuth, D.E.: Seminumerical Algorithms, 2nd edn. The Art of Computer Programming, vol.2. Addison-Wesley, Reading (1981)
12. Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83-97 (1955)
13. Microsoft. MSDN, chapter Random Class. Microsoft (2008), http://msdn2.microsoft.com/en-us/library/system.random.aspx
14. Pierskalla, W.P.: The multidimensional assignment problem. Operations Research 16, 422-431 (1968)
15. Robertson, A.J.: A set of greedy randomized adaptive local search procedure (grasp) implementations for the multidimensional assignment problem. Comput. Optim. Appl. 19(2), 145-164 (2001)