Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach

Discrete Applied Mathematics

Volumn 124, Issue 1-3, 2002, Pages 103-116

  Maia De Abreu, Nair Maria ^a   Netto, Paulo Oswaldo Boaventura ^a   Querido, Tania Maia ^b   Gouvea, Elizabeth Ferreira ^a,c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b CENTRO FEDERAL DE EDUCAÇÃO TECNOLÓGICA CELSO SUCKOW DA FONSECA   (Brazil)

^c FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

Author keywords

Difficulty measure; Quadratic assignment problem; Variance

Indexed keywords

EID: 84867975823     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00333-X     Document Type: Article

References (18)

1. E. Angel, and V. Zissimopoulos On the quality of the local search for the quadratic assignment problem Discrete Appl. Math. 82 1998 15 25
2. C.C.P. Barbut Automorphismes du permutoèdre et votes de Condorcet Math. Inform. Sci. Hum. 28e 111 1990 73 82
3. P.O. Boaventura-Netto, N.M.M. Abreu, Quadratic assignment problem: a polynomial expression for the variance of solutions (extended abstract), I ELIO/Optima 97, Concepción, Chile, November 1997.
4. P.O. Boaventura-Netto, N.M.M. Abreu, Cost solution average and variance in the quadratic assignment problem, Technical Report PEP 02/98, Programa de Engenharia de Produçao, COPPE/URFJ, 1998 (in Portuguese).
5. R.E. Burkard, E. Çela, A.M. Demidenko, N.N. Metelski, G.J. Woeginger, Perspectives of easy and hard cases of the quadratic assignment problem spezialforschungsbereich F003, Optimierung und Kontrolle, Bericht Nr104, Graz, 1997.
6. R.E. Burkard, S.E. Karisch, F. Rendl, QAPLIB - a quadratic assignment problem libaray, Report No. 287 CDLDO-41, Technische Universitat, Graz, 1994.
7. E. Çela, The quadratic assignment problem: theory and algorithms, in: Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, 1998.
8. M. Dell'Amico, F. Maffioli, and S. Martello Annotated Bibliographies in Combinatorial Optimization 1997 Wiley Chichester
9. J.W. Gavett, and N.V. Plyter The optimal assignment of facilities to locations by branch-and-bound Oper. Res. 14 1966 210 232
10. E.F. Gouvêa, Applications of statistics and algebra to QAP, qualifying examination to D.Sc., Programa de Engenharia de Produçao, COPPE/UFRJ, 1999 (in Portuguese).
11. G.W. Graves, and A.B. Whinston An algorithm for the quadratic assignment problem Manage. Sci. 17 1970 453 471
12. W. Herroeleven, and A. Van Gils On the use of flow dominance in complexity measures for facility layout problems Internat. J. Prod. Res. 23 1985 97 108
13. T.C. Koopmans, and M. Beckmann Assignment problems and the location of economic activities Econometrica 25 1 1957 53 76
14. T. Mautor, C. Roucairol, Difficulties of exact methods for solving the quadratic assignment problem, in: P. Pardlos, H. Wolkowics (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, AMS, Providence, RI, 1994.
15. R. Mojena, T. Vollmann, and Y. Okamoto On perdicting computational time of a branch-and-bound algorithm for the assignment of facilities Dec. Sci. 7 1976 856 867
16. P. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem SIAM J. Optim. 7 1 1997 280 294
17. P. Pardalos, H. Wolkowicz, The quadratic assignment problem: a survey of recent developments, in: P. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, AMS, Providence, 1994.
18. T.E. Vollmann, and E.S. Buffa The facility layout problem in perspective Manage. Sci. 12 1966 450 471