Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete Anti-Monge matrices

Cybernetics and Systems Analysis

Volumn 43, Issue 1, 2007, Pages 112-125

  Demidenko, V M ^a   Dolgui, A ^b  

^a INSTITUTE OF MATHEMATICS   (Belarus)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

Author keywords

Efficiently solvable cases; Limited versions; Monotonic Anti Monge matrices; Quadratic assignment problem; Toeplitz matrix

Indexed keywords

ANTI-MONGE MATRICES; MONOTONIC MATRICES; QUADRATIC ASSIGNMENT PROBLEM; TOEPLITZ MATRIX;

COMPUTATIONAL EFFICIENCY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

SYSTEMS ANALYSIS;

EID: 34250617901     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-007-0030-1     Document Type: Article

References (16)

1. P. Pardalos, F. Rendl, and H. Wolkowicz, "The quadratic assignment problem: A survey and recent developments," Discrete Math., 16, 1-42 (1994).
2. R. E. Burkard, B. Klinz, and R. Rudolf, "Perspectives of Monge properties in optimization," Discrete Appl. Math., 70, 95-161 (1996).
3. R. E. Burkard, E. Çela, V. M. Demidenko, N. N. Metelski, and G. J. Woeginger, Perspectives of Easy and Hard Cases of the Quadratic Assignment Problem, Rep. No. 104, Techn. Univ. Graz, Austria, Graz (1997).
4. G. H. Hardy, J. E. Littlewood, and G. Polya, "The maximum of a certain bilinear form," Proc. L.M.S, 25, 265-282 (1926).
5. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge Univ. Press, London-New York (1952).
6. B. B. Timofeev and V. A. Litvinov, "On the problem of organizing the disposition of information files on magnetic types," Cybern. Syst. Analysis, 5, No. 4, 421-426 (1969).
7. V. N. Burkov, M. I. Rubinshtein, and V. B. Sokolov, "Some optimization problems of arrangement of large memory volumes," Avtom. Telemekh., No. 9, 83-91 (1969).
8. N. N. Metel'skii, "On extreme values of a quadratic form on a symmetrical group," Izv. AN BSSR, Ser. Fiz.-Mat. Nauk, No. 6, 107-110 (1972).
9. V. R. Pratt, "An N log N algorithm to distribute N records optimally in a sequential access file," in: Complexity of Computer Computations, Plenum Press, New York (1972), pp. 111-118.
10. R. G. Vickson and X. Lu, "Optimal product and server locations in one-dimensional storage racks, " Europ. J. Oper. Res., 105, 18-28 (1998).
11. G. G. Polak, "A special case of the quadratic assignment model with an application to storage-and-retrieval devices," in: Proc. 11th Latin-Iberian American Congress of Operations Research (XI CLAIO), University of Concepton, Chile (2002), pp. 1-8.
12. E. Çela and G. J. Woeginger, "A note on the maximum of a certain bilinear form," Rep. No. 8, Techn. Univ. Graz, Austria, Graz (1994).
13. R. E. Burkard, E. Çela, R. Rote, and G. J. Woeginger, "The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: easy and hard cases," Math. Program., 82, 125-158 (1998).
14. V. M. Demidenko, "Generalization of strong resolvability conditions of a quadratic assignment problem with Anti-Monge and Toeplitz matrices," Dokl. NAN Belarusi, 47, No. 2, 15-18 (2003).
15. D. A. Suprunenko, Substitution Groups [in Russian], Nauka i Tekhnika, Minsk (1996).
16. T. C. Koopmans and M. J. Beckmann, "Assignment problems and the location of economic activities," Econometrica, 25, 53-76 (1957).