Abstract
The paper describes new sufficient conditions that provide optimum to a quadratic assignment problem for a given substitution. The conditions separate out sets of matrices in the matrix space. The sets are formed by incomplete Anti-Monge matrices, which permit opposite ordering of rows and columns, and by additive monotone matrices, which are outside the class of Toeplitz matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Pardalos, F. Rendl, and H. Wolkowicz, “The quadratic assignment problem: a survey and recent developments,” Discrete Math., 16, 1–42 (1994).
R. E. Burkard, B. Klinz, and R. Rudolf, “Perspectives of Monge properties in optimization,” Discrete Appl. Math., 70, 95–161 (1996).
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).
G. H. Hardy, J. E. Littlewood, and G. Polya, “The maximum of a certain bilinear form,” Proc. L.M.S, 25, 265–282 (1926).
G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge Univ. Press, London-New York (1952).
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).
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).
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).
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.
R. G. Vickson and X. Lu, “Optimal product and server locations in one-dimensional storage racks, ” Europ. J. Oper. Res., 105, 18–28 (1998).
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.
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).
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).
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).
D. A. Suprunenko, Substitution Groups [in Russian], Nauka i Tekhnika, Minsk (1996).
T. C. Koopmans and M. J. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, 25, 53–76 (1957).
Author information
Authors and Affiliations
Additional information
The study was partially supported by INTAS (Project 03-51-5501).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 135–151, January–February 2007.
Rights and permissions
About this article
Cite this article
Demidenko, V.M., Dolgui, A. Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices. Cybern Syst Anal 43, 112–125 (2007). https://doi.org/10.1007/s10559-007-0030-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-007-0030-1