Effective formulation reductions for the quadratic assignment problem

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 2007-2016

  Zhang, Huizhen ^a   Beltran Royo, Cesar ^a   Constantino, Miguel ^b  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Linear integer programming; Linear programming relaxation; Quadratic assignment problem; Sparse matrix

Indexed keywords

COMPUTATIONAL EXPERIMENT; CONSTRAINT REDUCTION; COST MATRICES; INTEGER LINEAR PROGRAMMING FORMULATION; LINEAR INTEGER PROGRAMMING; LINEAR PROGRAMMING RELAXATION; QUADRATIC ASSIGNMENT PROBLEMS; SPARSE MATRICES;

DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; TRAVELING SALESMAN PROBLEM;

MATRIX ALGEBRA;

EID: 77951108099     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.02.001     Document Type: Article

References (42)

1. Adams W.P., Guignard M., Hahn P.M., and Hightower W.L. A level-2 reformulation linearization technique bound for the quadratic assignment problem. European Journal of Operational Research 180 3 (2007) 983-996
2. Adams W.P., and Johnson T.A. Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society 16 (1994) 43-75
3. Ahuja R.K., Orlin J.B., and Tivari A. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27 10 (2000) 917-934
4. Anstreicher K., Brixius N., Goux J.-P., and Linderoth J. Solving large quadratic assignment problems on computational grids. Mathematical Programming 91 3 (2002) 563-588
5. Anstreicher K.M. Recent advances in the solution of quadratic assignment problems. Mathematical Programming 97 1-2 (2003) 27-42
6. Brixius N.W., and Anstreicher K.M. Solving quadratic assignment problems using convex quadratic programming relaxations. Optimization Methods and Software 16 1-4 (2001) 49-68
7. Brusco M.J., and Stahl S. Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. Journal of Classification 17 2 (2000) 197-223
8. Burkard R.E., Karisch S.E., and Rendl F. Qaplib-a quadratic assignment problem library. Journal of Global Optimization 10 4 (1997) 391-403
9. Cela E. The quadratic assignment problem: theory and algorithms (1998), Kluwer Academic Publishers, London
10. Commander CW. A survey of the quadratic assignment problem with applications. Morehead Electronic Journal of Applicable Mathematics 2005;4:1-15.
11. Connolly D.T. An improved annealing scheme for the qap. European Journal of Operational Research 46 1 (1990) 93-100
12. Crainic T.G., Le Cun B., and Roucairol C. Parallel combinatorial optimization, parallel branch-and-bound algorithms (2006), Wiley 1-28 [chapter 1]
13. Drezner Z. Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Computers and Operations Research 35 3 (2008) 717-736
14. Duman E., and Or I. The quadratic assignment problem in the context of the printed circuit board assembly process. Computers and Operations Research 34 1 (2007) 163-179
15. Erdogan G., and Tansel B. A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Computers and Operations Research 34 4 (2007) 1085-1106
16. Frieze A.M., and Yadegar J. On the quadratic assignment problem. Discrete Applied Mathematics 5 1 (1983) 89-98
17. Gambardella L.M., Taillard E.D., and Dorigo M. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50 2 (1999) 167-176
18. Geoffrion A.M., and Graves G.W. Scheduling parallel production lines with changeover costs: practical applications of a quadratic assignment/lp approach. Operations Research 24 4 (1976) 595-610
19. Gilmore P.C. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal on Applied Mathematics 10 2 (1962) 305-313
20. Hadley S.W., Rendl F., and Wolkowicz H. A new lower bound via projection for the quadratic assignment problem. Mathematics of Operations Research 17 3 (1992) 727-739
21. Hahn P., Grant T., and Hall N. A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. European Journal of Operational Research 108 3 (1998) 629-640
22. Kaufmann L., and Broeckxm F. An algorithm for the quadratic assignment problem using benders' decomposition. European Journal of Operational Research 2 3 (1978) 204-211
23. Koopmans T.C., and Beckmann M.J. Assignment problems and the location of economic activities. Econometrica 25 1 (1957) 53-76
24. Lawler E.L. The quadratic assignment problem. Management Science 9 4 (1963) 586-599
25. Li Y., Pardalos P.M., Ramakrishnan K.G., et al. Lower bounds for the quadratic assignment problem. Annals of Operations Research 50 1 (1994) 387-441
26. Li Y., Pardalos P.M., and Resende M.G.C. A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society 16 (1994) 237-261
27. Loiola E.M., Abreu N.M.M., Boaventura-Netto P.O., et al. A survey for the quadratic assignment problem. European Journal of Operational Research 176 2 (2007) 657-690
28. Mans B., Mautor T., and Roucairol C. A parallel depth first search branch and bound algorithm for the quadratic assignment problem. European Journal of Operational Research 81 3 (1995) 617-628
29. Elf M. Lp-basierte schranken fur quadratische zuordnungsprobleme mit dunner zielfunktion. Master's thesis, Universitat of Koln; 1999.
30. Misevicius A. A modified simulated annealing algorithm for the quadratic assignment problem. Informatica 14 4 (2003) 497-514
31. Junger M., and Kaibel V. Box-inequalities for quadratic assignment polytopes. Mathematical Programming 91 Ser.A (2001) 175-197
32. Junger M., and Kaibel V. On the sqap polytop. Discrete Applied Mathematics 111 3 (2001) 283-306
33. Junger M., and Kaibel V. The qap polytope and the star-transformation. SIAM Journal of Optimization 11 2 (2001) 444-468
34. Padberg M.W., and Rijal M.P. Location, scheduling, design and integer programming (1996), Kluwer Academic Publishers, Boston
35. Pardalos P.M., Rendl F., and Wolkowicz H. The quadratic assignment problem: a survey and recent developments. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society 16 (1994) 1-42
36. Pollatschek M.A., Gershoni N., and Radday Y.T. Optimization of the typewriter keyboard by simulation. Angewandte Informatik 17 (1976) 438-439
37. Ramakrishnan KG, Resende MGC, Pardalos PM. A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming. In: State of the art in global optimization: computational methods and applications. Kluwer Academic Publishers; 1996. p. 57-73.
38. Resende M.G.C., Ramakrishnan K.G., and Drezner Z. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research 43 5 (1995) 781-791
39. Sahni S., and Gonzalez T. P-complete approximation problems. Journal of the Association of Computing Machinery 23 3 (1976) 555-565
40. Kaibel V. Polyhedral methods for the QAP. In: Nonlinear assignemnt problems: algorithms and applications. Kluwer Academic Publishers; 2000. p. 109-41.
41. Xia Y. Improved gilmore-lawler bound for quadratic assignment problems. Chinese Journal of Engineering Mathematics 24 3 (2007) 401-413
42. Zhao Q., Karisch S.E., Rendl F., et al. Semidefinite programming relaxations for the quadratic assignment problem. Journal of Combinatorial Optimization 2 1 (1998) 71-109