The distribution of values in the quadratic assignment problem

Mathematics of Operations Research

Volumn 28, Issue 1, 2003, Pages 64-91

  Barvinok, Alexander ^a   Stephen, Tamon ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Distribution; Heuristics; Quadratic assignment problem; Randomized algorithms; Representation theory; Symmetric group

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; HEURISTIC PROGRAMMING; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

HAMMING METRIC; PERMUTATIONS; QUADRATIC ASSIGNMENT PROBLEM; RANDOMIZED ALGORITHMS; REPRESENTATION THEORY;

QUADRATIC PROGRAMMING;

EID: 0038638965     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.28.1.64.14262     Document Type: Article

References (13)

1. Anstreicher, K., N. Brixius, J-P. Goux, J. Linderoth. 2002. Solving large quadratic assignment problems on computational grids. Math. Programming. Ser. B 91(3) 563-588.
2. Arkin, E., R. Hassin, M. Sviridenko, 2001. Approximating the maximum quadratic assignment problem. Inform. Processing Lett. 77(1) 13-16.
3. Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. 1999. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Berlin, Germany.
4. 2k norms for functions on orbits. Foundations of Comput. Math. 2 393-412.
5. Brüngger, A., A. Marzetta, J. Clausen, M. Perregaard. 1998. Solving large scale quadratic assignment problems in parallel with the search library ZRAM. J. Parallel and Distributed Comput. 50 157-166.
6. Burkard, R., E. Çela, P. Pardalos, L. Pitsoulis. 1999. The quadratic assignment problem. D.-Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 75-149.
7. Fulton, W., J. Harris. 1991. Representation Theory. Springer-Verlag, New York.
8. Goulden, I. P., D. M. Jackson. 1983. Combinatorial Enumeration, Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, New York.
9. Graves, G. W., A. B. Whinston. 1970. An algorithm for the quadratic assignment problem. Management Sci. 17(7) 453-471.
10. Lawler, E. L. 1963. The quadratic assignment problem. Management Sci. 9 586-599.
11. Papadimitriou, C. H., K. Steiglitz. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ.
12. Stephen, T. 2002. The distribution of values in combinatorial optimization problems. Ph.D. dissertation, University of Michigan, Ann Arbor, MI.
13. Ye, Y. 1999. Approximating global quadratic optimization with convex quadratic constraints. J. Global Optim. 15(1) 1-17.