A solvable case of the quadratic assignment problem

Operations Research Letters

Volumn 22, Issue 1, 1998, Pages 13-17

  Deǐneko, Vladimir G ^a,b   Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b OLES HONCHAR DNIPRO NATIONAL UNIVERSITY   (Ukraine)

Author keywords

Circulant matrix; Kalmanson condition; Quadratic assignment problem; Travelling salesman problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; FUNCTIONS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

KALMANSON CONDITIONS; QUADRATIC ASSIGNMENT PROBLEMS (QAP); SYMMETRIC CIRCULANT MATRIX; TRAVELLING SALESMAN PROBLEMS;

COMBINATORIAL MATHEMATICS;

EID: 0031997558     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00047-3     Document Type: Article

References (13)

1. H.J. Bandelt, A.W.M. Dress, A canonical decomposition theory for metrics of a finite set, Adv. Math. 92 (1992) 47-105.
2. A. Bruengger, A. Marzetta, J. Clausen, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems, in: Proc. 11th Internat. Parallel Processing Symp. IPPS 97, Geneva, IEEE Computer Soc. Press, Silver Spring, MD, 1997, pp. 418-427.
3. R.E. Burkard, Locations with spatial interactions: the quadratic assignment problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Ch. 9, Wiley, New York, 1990, pp. 387-437.
4. R.E. Burkard, E. Cela, G. Rote, G.J. Woeginger, The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases, in: Proc. IPCO V, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 204-218.
5. G. Christopher, M. Farach, M. Trick, in: Proc. ESA IV, Lecture Notes in Computer Science, vol. 1136, Springer, Berlin, 1996, pp. 406-418.
6. P.J. Davis, Circulant Matrices, Wiley, New York, 1979.
7. V.G. Deǐneko, R. Rudolf, G.J. Woeginger, Sometimes travelling is easy: the master tour problem, in: Proc. ESA III, Lecture Notes in Computer Science, vol. 979, Springer, Berlin, 1995, pp. 128-141.
8. K. Kalmanson, Edgeconvex circuits and the travelling salesman problem, Canad. J. Math. 27 (1975) 1000-1010.
9. T.C. Koopmans, M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25 (1957) 53-76.
10. E.L. Lawler, The quadratic assignment problem, Management Sci. 9 (1963) 586-599.
11. E.L. Lawler, The quadratic assignment problem: a brief review, in: B. Roy (Ed.), Combinatorial Programming: Methods and Applications, Kluwer, Dordrecht, Holland, 1975, pp. 351-360.
12. Y. Li, P.M. Pardalos, Generating quadratic assignment problems with known optimal permutations, Comput. Optim. Appl. 1 (1992) 163-184.
13. P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments, in: P. Pardalos, H. Wolkowicz (Eds.), Proc. DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, 1994, pp. 1-42.