The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 204-218

  Burkard, Rainer E ^a   Çela, Eranda ^a   Rote, Günther ^a   Woeginger, Gerhard J ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAVITATION; INTEGER PROGRAMMING; TRAVELING SALESMAN PROBLEM;

FOLLOWING PROBLEM; GRAVITY CENTERS; LINEAR ARRANGEMENTS; NUMERICAL PROBLEMS; POLYNOMIALLY SOLVABLE; QUADRATIC ASSIGNMENT PROBLEMS; REGULAR POLYGON; TOEPLITZ MATRICES;

MATRIX ALGEBRA;

EID: 21344431637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_16     Document Type: Conference Paper

References (12)

1. Amiouny, S.V., Bartholdi, J.J. III, Vande Vate, J.H., Zhang, J.: Balanced loading, Operations Research 40 (1992) 238-246
2. Bolotnikov, A.A.: On the best balance of the disk with masses on its periphery, (in Russian), Problemi Mashinostroenia 6 (1978) 68-74
3. Burkard, R.E.: Locations with spatial interactions: The quadratic assignment problem, Discrete Location Theory (Mirchandani, P.B., Francis, R.L., eds.), John Wiley, New York (1990) 387-437
4. Burkard, R.E., Çela, E., Rote, G., Woeginger, G.J.: The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: easy and hard cases, Technical report SFB-34 (1995) Institut für Mathematik B, Technische Universitãt Graz file://ftp.tu-graz.ac.at/pub/papers/aath/afb34.pβ.gz
5. Burkov, V.N., Rubinstein, M.I., Sokolov, V.B.: Some problems in optimal allocation of large-volume memories, (in Russian), Avtomatika i Telemekhanika 9 (1969) 83-91
6. Clausen, J., Perregård, M.: Solving Large Quadratic Assignment Problems in Parallel, Computational Optimization and Applications (1994) (to appear)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)
8. Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities, Econometrica 25 (1957) 53-76
9. Laporte, G., Mercure, H.: Balancing hydraulic turbine runners: a quadratic assignment problem, European J. Oper. Res. 35 (1988) 378-382
10. Lawler, E.L.: The quadratic assignment problem: a brief review, Combinatorial Programming: Methods and Applications, (Roy, B., ed.), Dordrecht, Holland (1975) 351-360
11. PardaloB. P., Rendl, F., Wolkowicz, H.: The Quadratic Assignment Problem: A Survey and Recent Developments, Proceedings of the DIMACS Workshop on Quadratic Assignment Problems (Pardalos, P., Wolkowicz, H., eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 18 (1994) 1-42
12. Supnick, F.: Extreme Hamiltonian lines, Annals of Math. 66 (1957) 179-201