An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem

Informatica

Volumn 11, Issue 3, 2000, Pages 281-296

  Palubeckis, Gintaras ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Combinatorial optimization; Quadratic assignment problem; Test cases

Indexed keywords

EID: 0347937376     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. Battiti, R., and G. Tecchiolli (1994). The reactive tabu search. ORSA Journal on Computing, 6, 126-140.
2. Burkard, R.E. (1984). Quadratic assignment problems. European Journal of Operational Research, 15, 283-289.
3. Burkard, R.E., E. Çela, P.M. Pardalos and L.S. Pitsoulis (1998). The quadratic assignment problem. SFB Report 126, Institute of Mathematics, Technical University Graz, Austria, to appear in P.M. Pardalos and D.-Z. Du (Eds.), Handbook of combinatorial optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands.
4. Burkard, R.E., S.E. Karisch and F. Rendl (1997). QAPLIB - a quadratic assignment problem library. Journal of Global Optimization, 10, 391-403.
5. Burkard, R.E., and F. Rendl (1984). A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operational Research, 17, 169-174.
6. Çela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht, The Netherlands.
7. Clausen, J., S.E. Karisch, M. Perregaard and F. Rendl (1996). On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel. Technical Report DIKU-TR-96/24, Department of Computer Science, University of Copenhagen, Denmark, to appear in Computational Optimization and Applications.
8. Clausen, J., and M. Perregaard (1997). Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 8, 111-127.
9. Connolly, D.T. (1990). An improved annealing scheme for the QAP. European Journal of Operational Research, 46, 93-100.
10. Cung, V-D., T. Mautor, P. Michelon and A. Tavares (1996). A scatter search based approach for the quadratic assignment problem. Technical Report No.96/037, Université de Versailles, France.
11. Cyganski, D., R.F. Vaz and V.G. Virball (1994). Quadratic assignment problems generated with the Palubetskis algorithm are degenerate. IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, 41, 481-484.
12. Elshafei, A.E. (1977). Hospital layout as a quadratic assignment problem. Operations Research Quarterly, 28, 167-179.
13. Fleurent, C., and J.A. Ferland (1994). Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 173-187.
14. Gambardella, L.M., E.D. Taillard and M. Dorigo (1997). Ant colonies for the QAP. Technical Report IDSIA-4-97, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, Switzerland.
15. Geoffrion, A., and G. Graves (1976). Scheduling parallel production lines with changeover costs: practical application of a quadratic assignment/LP approach. Operations Research, 24, 595-610.
16. Hubert, L. (1987). Assignment Methods in Combinatorial Data Analysis. Marcel Dekker, Inc., New York.
17. Krarup, J., and P. Pruzan (1978). Computer-aided layout design. Mathematical Programming Study, 9, 75-94.
18. Laporte, G., and H. Mercure (1988). Balancing hydraulic turbine runners: a quadratic assignment problem. European Journal of Operational Research, 35, 378-381.
19. Li, Y., and P.M. Pardalos (1992). Generating quadratic assignment test problems with known optimal permutations. Computational Optimization and Applications, 1, 163-184.
20. Li, Y., P.M. Pardalos and M.G.C. Resende (1994). A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 237-261.
21. Mautor, T., and C. Roucairol (1994). A new exact algorithm for the solution of quadratic assignment problems. Discrete Apphed Mathematics, 55, 281-293.
22. Murthy, K.A., P.M. Pardalos and Y. Li (1992). A local search algorithm for the quadratic assignment problem. Informatica, 3, 524-538.
23. Nugent, C.E., T.E. Vollmann and J. Ruml (1968). An experimental comparison of techniques for the assignment of facilities to locations. Operations Research, 16, 150-173.
24. Palubeckis, G.S. (1988). A generator of quadratic assignment test problems with known optimal solution. U.S.S.R. Computational Mathematics and Mathematical Physics, 28, 97-98. [Translated from Zh. Vychisl. Mat. Mat. Fiz., 28, 1740-1743.]
25. Palubeckis, G.S. (1988). A generator of quadratic assignment test problems with known optimal solution. U.S.S.R. Computational Mathematics and Mathematical Physics, 28, 97-98. [Translated from Zh. Vychisl. Mat. Mat. Fiz., 28, 1740-1743.]
26. Palubeckis, G. (1997). The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. Informatica, 8, 377-400.
27. Palubeckis, G. (1999). Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem. Journal of Global Optimization, 15, 127-156.
28. Pardalos, P.M., F. Rendl and H. Wolkowicz (1994). The quadratic assignment problem: a survey and recent developments. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 1-42.
29. Pardalos, P.M., M.G.C. Resende and Y. Li (1996). FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 22, 104-118.
30. Pardalos, P.M., M.G.C. Resende and L.S. Pitsoulis (1997). Algorithm 769: FORTRAN subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 23, 196-208.
31. Sanchis, L.A. (1990). On the complexity of test case generation for NP-hard problems. Information Processing Letters, 36, 135-140.
32. Skorin-Kapov, J. (1990). Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2, 33-45.
33. Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443-455.
34. Taillard, E.D. (1995). Comparison of iterative searches for the quadratic assignment problem. Location Science, 3, 87-105.
35. Tate, D.M., and A.E. Smith (1995). A genetic approach to the quadratic assignment problem. Computers and Operations Research, 22, 73-83.
36. Wilhelm, M.R., and T.L. Ward (1987). Solving quadratic assignment problems by simulated annealing. IEEE Transactions, 19, 107-119.