Geodesic
Polynomial algorithms for solving the quadratic assignment problem on networks
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 11, pp. 2052-2059 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Polynomial algorithms for solving the quadratic assignment problem on special types of networks are proposed. The structure of the links between the objects to be located is represented by a graph. 
@article{ZVMMF_2010_50_11_a16,
     author = {G. G. Zabudskii and A. Yu. Lagzdin},
     title = {Polynomial algorithms for solving the quadratic assignment problem on networks},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2052--2059},
     year = {2010},
     volume = {50},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a16/}
}
TY  - JOUR
AU  - G. G. Zabudskii
AU  - A. Yu. Lagzdin
TI  - Polynomial algorithms for solving the quadratic assignment problem on networks
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2010
SP  - 2052
EP  - 2059
VL  - 50
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a16/
LA  - ru
ID  - ZVMMF_2010_50_11_a16
ER  - 
%0 Journal Article
%A G. G. Zabudskii
%A A. Yu. Lagzdin
%T Polynomial algorithms for solving the quadratic assignment problem on networks
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2010
%P 2052-2059
%V 50
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a16/
%G ru
%F ZVMMF_2010_50_11_a16
G. G. Zabudskii; A. Yu. Lagzdin. Polynomial algorithms for solving the quadratic assignment problem on networks. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 11, pp. 2052-2059. http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a16/

[1] Akhmedov I. S., Sigal I. Kh., Zadacha komponovki skhemy gosplana predpriyatii i nekotorye podkhody k ee resheniyu, Dep. v VINITI, No 270, M., 1983

[2] Demidenko V. M., “Obobschenie uslovii silnoi razreshimosti kvadratichnoi zadachi o naznacheniyakh s matritsami anti-Monzha i Teplitsa”, Dokl. NAN Belarusi, 47:2 (2003), 15–18 | MR | Zbl

[3] Zabudskii G. G., “O nekotorykh zadachakh razmescheniya na grafakh”, Metody optimizatsii i ikh prilozheniya, Tr. XI Baikalskoi mezhdunar. shkoly-seminara, Irkutsk, 1998, 135–138

[4] Zabudskii G. G., Lagzdin A. Yu., “Algoritm resheniya kvadratichnoi zadachi o naznacheniyakh s minimaksnym kriteriem na dereve”, Dinamika sistem, mekhanizmov i mashin, Materialy VII Mezhdunar. nauchno-tekhn. konf., v. 3, Omsk, 2009, 23–27

[5] Metelskii N. N., “Metody lokalnoi optimizatsii dlya zadachi razmescheniya dvudolnykh grafov”, Zh. vychisl. matem. i matem. fiz., 24:9 (1984), 1428–1432 | MR

[6] Sergeev S. I., “Kvadratichnaya zadacha naznacheniya, I”, Avtomatika i telemekhan., 1999, no. 8, 127–147 | MR | Zbl

[7] Burkard R. E., Çela E., Rote G., Woeginger G. J., “The quadratic assignment problem with a monotone anti-Monge matrix and a symmetric Toeplitz matrix: Easy and hard cases”, Math. Program., Ser. B, 82 (1998), 125–158 | MR | Zbl

[8] Burkard R. E., Dell'Amico M., Martello S., Assignment problems, SIAM, Philadelphia, 2009 | MR | Zbl

[9] Çela E., The quadratic assignment problem: Theory and algorithms, Kluwer Acad. Publs, Dordrecht, 1998 | MR

[10] Demidenko V. M., Finke G., Gordon V. S., “Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices”, J. Math. Modelling and Algorithms, 5:2 (2006), 167–187 | DOI | MR | Zbl

[11] Farahani R. Z., Hekmatfar M., Facility location: Concepts, models, algorithms and case studies, Physica-Verlag, Heidelberg, 2009 | Zbl

[12] Finke G., Burkard R. E., Rendl F., “Quadratic assignment problems”, Ann. Discrete Math., 1987, no. 31, 61–82 | MR | Zbl

[13] Koopmans T. C., Beckmann M., “Assignment problems and the location of economica activities”, Econometrica, 25 (1957), 53–76 | DOI | MR | Zbl

[14] Hardy G. H., Littlewood J. E., Polya G., “The maximum of a certain bilinear form”, Proc. London Math. Soc., 25 (1926), 265–282 | DOI | Zbl

[15] Iordanskii M. A., “Zadachi razmescheniya grafov, 2”, Kombinatorno-algebraich. metody v prikl. matem., Mezhvuz. sb., GGU im. Lobachevskogo, Gorkii, 1982, 26–65 | MR

[16] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR