Graph modeling for quadratic assignment problems associated with the hypercube

AIP Conference Proceedings

Volumn 1146, Issue , 2009, Pages 65-79

  Mittelmami, Hans ^a   Peng, Jiming ^b   Wu, Xiaolin ^c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Graph modeling; Integer linear program (ILP); Lower bound; Quadratic assignment problem (QAP); Relaxation

Indexed keywords

EID: 70450245591     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.3183570     Document Type: Conference Paper

References (41)

1. W.P. Adams and T.A. Johnson, "Improved Linear Programming-Based Lower Bounds for the Quadratic Assignment Problem", In P.M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, DIM ACS 25 Series in Discrete Mathematics and Theoretical Computer Science, 1994, pp. 43-75.
2. W.P. Adams and H.D. Sherali, "A tight linearization and an algorithm for zero-one quadrtic programming problems". Management Science, 32, 1274-1290 (1986).
3. W.P. Adams and H.D. Sherali, "A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems". SIAM J. Discrete Applied Mathematics 52, 83-106 (1990).
4. K.M. Anstreicher and N.W. Brixius, "A new bound for the quadratic assignment problem based on convex quadratic programming". Mathematical Programming 80, 341-357 (2001).
5. K.M. Anstreicher, N.W. Brixius, J.-P. Goux, and J.Linderoth. "Solving large quadratic assignment problems on conputational grids". Mathematical Programming 91, 563-588 (2002).
6. G. Ben-David and D. Malah, "Bounds on the performance of vector-quantizers under channel errors". IEEE Transactions on Information Theory, 51, 2227-2235 (2005).
7. R. E. Burkard, "Efficiently Solvable Special Cases of Hard Combinatorial Optimization Problems", Mathematical Programming 79, 55-69 (1997).
8. R. E. Burkard, E. Çela, G. Rote and G.J. Woeginger, "The Quadratic Assignment Problem with a Monotone Anti-Monge Matrix and a Symmetric Toeplitz Matrix: Easy and Hard Cases", Mathematical Programming, 82, 125-158 (1998).
9. R.E. Burkard and J. Offermann. "Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme". Zeitschriftjur Operations Research 21, B121-B132 (1977).
10. R.E. Burkard, E. Çela, S.E. Karisch andF. Rendl, "QAPLIB-A quadratic assignment problem library". J. Global Optimization, 10, 391-403(1997).
11. N.T Cheng and N.K. Kingsburg, "Robust zero-redundancy vector quantization for noisy channels". In Proceedings of the International Conference on Communications, Boston, 1989, pp. 1338-1342.
12. N. Christofides and E. Benavent, "An exact algorithm for the quadratic assignment problem". Operations Research, 37, 760-768, (1989).
13. N. Christofides and M. Gerrard, "A graph theoretical analysis of bounds for the quadratic assignment problem". In P. Hansen eds: Studies on Graphs and Discrete programming. North Holland, 1981, pp. 61-68.
14. Z. Drezner, "Lower bounds based on linear programming for the quadratic assignment problem". Comput. Optim. & Applic, 4, 159-169 (1995).
15. G. Finke, R.E. Burkard, and F. Rendl, "Quadratic assignment problems". Annals of Discrete Mathematics, 31, 61-82 (1987).
16. A.M. Frieze and J. Yadegar, "On the quadratic assignment problem". Discrete Applied Mathematics, 5, 89-98 (1983).
17. J.W. Gavett and N.V. Plyter, "The optimal assignment of facilities to locations by branch-and-bound". Operations Research, 14, 210-232 (1966).
18. P.C. Gilmore, "Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal on Applied Mathematics, 10, 305-313 (1962).
19. S.W. Hadley, F. Rendl, and H. Wolkowicz, "A new lower bound via projection for the quadratic assignment problem".Mathematics of Operations Research, 17, 727-739 (1992).
20. P. Halm, and T. Grant, "Lower bounds for the quadratic assignment problem based upon a dual formulation". Operations Research, 46, 912-922 (1998).
21. P. Halm, W.L. Hightower, T.A. Johnson, M. Guiguard-Spielberg and C. Roucairol, "A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation- Linearization Technique", University of Pennsylvania, Department of Systems Engineering, Technical Report, 2001.
22. M. Hannan and J.M. Kurtzberg, "Placement techniques". In Design Automation of Digital Systems: Theory and Techniques, M.A. Breuer Ed., vol(l). Prentice-hall: Englewood Cliffs, 1972, pp. 213-282.
23. L.H. Harper, "Optimal assignments of numbers to vertices". J. of the Society for Industrial and Applied Mathematics, 12 , 131-135(1964).
24. S .E. Karisch, E. Qela, J. Clausen, and T Espersen, "A dual framework for lower bounds of the quadratic assignment problem based on linearization". Computing, 63, 351-403 (1999).
25. S.E. Karisch and F. Rendl, "Lower bounds for the quadratic assignment problem via triangle decompositions". Mathematical Programming, 71, 137-152 (1995).
26. L. Kaufman and F. Broeckx, "An algorithm for the quadratic assignment problem using Benders decomposition", EuropeanJournal of Operational Research, 2, 204-211 (1978).
27. T. Koopmans and M. Beckmann. "Assignment problems and the location of economic activities", Econometrica, 25, 53-76 (1957).
28. E. Lawler, "The quadratic assignment problem". Management Science, 9, 586-599 (1963).
29. J.M. Laborde, S. Prakash and R. Hebbare, "Another characterization of hypercubes". Discrete Mathematics, 39, 161-166 (1982).
30. E.M. Loiola, N.M. Mala de Abreu, P.O. Boaventura-Netto, P. Halm, and T Querido, "A survey for the quadratic assignment problem". European J. Oper Res., 176, 657-690 (2007).
31. T. Mautor and C. Roucairol. "A new exact algorithm for the solution of quadratic assignment problems". Discrete AppliedMathematics, 55, 281-293 (1994).
32. C.E. Nugent, T.E. VoUman, and J. Ruml, "An experimental comparison of techniques for the assignment of facilities tolocations". Operations Research, 16, 150-173 (1968).
33. L.C. Potter and D.M. Chiang, "Minimax nonredundant channel coding". IEEE Transactions on Communications, 43, 804-811 (1995).
34. K.G. Ramakrislman, M.G.C. Resende, B. Ramachandran. and J.F. Pekny, "Tight QAP bounds via linear programming". In: Combinatorial and Global Optimization, Eds by P.M. Pardalos, A. Migdalas, and R.E. Burkard, World Scientific Publishing, Singapore, 2002, pp. 297-303.
35. M.G.C. Resende, K.G. Ramakarishnan and Z. Drezner, "Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming". Operations Research, 43, 781-791 (1995).
36. M. Scriabin and R.C. Vergin, "Conparison of computer algorithms and visual based methods for plant layout". Management Science, 22, 172-187 (1975).
37. J. Skorin-Kapov, "Tabu search applied to the quadratic assingnment problem". ORSA Journal on Computing, 2, 33-45 (1990).
38. E.D. Taillard, "Comparison of iterative searches for the quadratic assingnment problem". Location Science, 3, 87-105 (1995).
39. X. Wang, X. Wu and S. Dumitrescu, "On optimal index assignment for MAP decoding of Markov sequences". Technical report. Department of Electrical and Computer Engineering, McMaster University, Ontario, Canada, 2006.
40. K. Zeger and A. Gersho, "Pseudo-Gray Code". IEEE Trans, on Communications, 38, 2147-2158 (1990).
41. Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, "Semidefinite programming relaxations for the quadratic assignment problem". J. Combinatorial Optimization, 2, 71-109 (1998).