A unified approach to simple special cases of extremal permutation problems

Optimization

Volumn 44, Issue 2, 1998, Pages 123-138

  Burkard, Rainer E ^a   Çela, Eranda ^a   Demidenko, Vitaly M ^b   Metelski, Nikolai N ^b   Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF MATHEMATICS   (Belarus)

Author keywords

Assignment problem; Combinatorial optimization; Factorization of permutations; Partial order; Quadratic assignment problem

Indexed keywords

EID: 26444479823     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939808844404     Document Type: Article

References (17)

1. Bokhari, S. (1987). Assignment problems in parallel and distributed computing, The Kluwer International Series in Engineering and Computer Science, Kluwer Academic Publishers, Boston/Dordrecht/Lancaster.
2. Burkard, R. E. (1990). Locations with spatial interactions: The quadratic assignment problem, Discrete Location Theory, Ch. 9 (Mirchandani, P. B. and Francis, R. L., Eds.), J. Wiley, New York, pp. 387-437.
3. Burkard, R. E., Çela, E., Rote, G. and Woeginger, G. J. The Quadratic Assignment Problem with a monotone Anti-Monge and a symmetric Toeplitz matrix: Easy and Hard cases, to appear in Mathematical Programming. Extended abstract in Proceedings of the 5th International IPCO Conference, June 1996, Springer Lecture Notes in Computer Science, 1084, 204-219.
4. Burkard, R. E., Klinz, B. and Rudolf, R. (1996). Perspectives of Monge properties in optimization, Discrete Applied Mathematics, 70, 95-161.
5. Burkov, V. N., Rubinstein, M. I. and Sokolov, V. B. (1969). Some problems in optimal allocation of large-volume memories, Avtomatika i Telemekhanika, 9, 83-91. (in Russian).
6. Demidenko, V. M. (1979). The traveling salesman problem with an asymmetric matrix, Vesti Akad. Nauk BSSR, Physics and Math. Sci., Minsk, pp. 29-35, (in Russian).
7. Demidenko, V. M. (1984). On optimizing functions on subsets of the symmetric group, Vesti Akad. Nauk BSSR, Physics and Math. Sci., Minsk, pp. 3-7. (in Russian).
8. Hubert, L. (1987). Assignment Methods in Combinatorial Data Analysis, Marcel Dekker, Inc. New York.
9. Koopmans, T. C. and Beckmann, M. J. (1957). Assignment problems and the location of economic activities, Econometrica, 25, 53-76.
10. Krushevski, A. V. (1964). The linear programming problem on a permutation group, Proceedings of the seminar on methods of mathematical modeling and theory of electrical circuits, Institute of Cybernetics of the Academy of Sciences of Ukraine, pp. 364-371. (in Russian).
11. Krushevski, A. V. (1965). Extremal problems for linear forms on permutations and applications, Proceedings of the seminar on methods of mathematical modeling and theory of electrical circuits, Institute of Cybernetics of the Academy of Sciences of Ukraine, pp. 262-269 (in Russian).
12. Lawler, E. L., Lenstra, J. K., Rinnooy, A. H. G. and Shmoys, D. B. (1985). The traveling salesman problem, Wiley, Chichester.
13. Metelski, N. N. (1972). On extremal values of quadratic forms on symmetric groups, Vest Akad. Nauk BSSR Ser. Fiz.-Mat. Nauk, 6, 107-110 (in Russian).
14. Pardalos, P. and Wolkowicz, H., Eds. (1994). Quadratic Assignment and Related Problems, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 16, American Math. Society.
15. Pardalos, P., Rendl, F. and Wolkowicz, H. (1994). The quadratic assignment problem: A survey and Recent Developments, in Quadratic Assignment and Related Problems (Pardalos, P. and Wolkowicz, H., Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, American Math. Society, pp. 1-42.
16. Pratt, V. R. (1972). An N log N algorithm to distribute N records optimally in a sequential access file, in: Complexity of Computer Computations (Miller, R. E. and Thatcher, J. W., Eds.), Plenum Press, New York, 111-118.
17. Rubinstein, M. I. (1973). Some properties of an assignment problem, Automatika i Telemekhanika, 1, 135-138. (in Russian).