Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2007_14_1_a0,
author = {E. V. Alekseeva and Yu. A. Kochetov},
title = {{\CYRG}{\cyre}{\cyrn}{\cyre}{\cyrt}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyri}{\cyrishrt} {\cyrl}{\cyro}{\cyrk}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrishrt} {\cyrp}{\cyro}{\cyri}{\cyrs}{\cyrk} {\cyrd}{\cyrl}{\cyrya} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyro} $p$-{\cyrm}{\cyre}{\cyrd}{\cyri}{\cyra}{\cyrn}{\cyre} {\cyrs}~{\cyrp}{\cyrr}{\cyre}{\cyrd}{\cyrp}{\cyro}{\cyrch}{\cyrt}{\cyre}{\cyrn}{\cyri}{\cyrya}{\cyrm}{\cyri} {\cyrk}{\cyrl}{\cyri}{\cyre}{\cyrn}{\cyrt}{\cyro}{\cyrv}},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {3--31},
publisher = {mathdoc},
volume = {14},
number = {1},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2007_14_1_a0/}
}
TY - JOUR AU - E. V. Alekseeva AU - Yu. A. Kochetov TI - Генетический локальный поиск для задачи о $p$-медиане с~предпочтениями клиентов JO - Diskretnyj analiz i issledovanie operacij PY - 2007 SP - 3 EP - 31 VL - 14 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2007_14_1_a0/ LA - ru ID - DA_2007_14_1_a0 ER -
E. V. Alekseeva; Yu. A. Kochetov. Генетический локальный поиск для задачи о $p$-медиане с~предпочтениями клиентов. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 1, pp. 3-31. http://geodesic.mathdoc.fr/item/DA_2007_14_1_a0/
[1] Beresnev V. L., Gimadi E. Kh., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR
[2] Gorbachevskaya L. E., Polinomialno razreshimye i NP-trudnye dvukhurovnevye zadachi standartizatsii, Diss. ... kand. fiz.-mat. nauk, Novosibirsk, 1998
[3] Gorbachevskaya L. E., Dementev V. T.,Shamardin Yu. V., “Dvukhurovnevaya zadacha standartizatsii s usloviem edinstvennosti optimalnogo potrebitelskogo vybora”, Diskret. analiz i issled. operatsii. Ser. 2, 6:2 (1999), 3–11 | MR | Zbl
[4] Eremeev A. V., “Geneticheskii algoritm dlya zadachi o pokrytii”, Diskret. analiz i issled. operatsii. Ser. 2, 7:1 (2000), 47–60 | MR | Zbl
[5] Kochetov Yu. A., “Dvukhurovnevye zadachi razmescheniya”, Trudy Instituta vychislitelnoi matematiki i matematicheskoi geofiziki SO RAN. Ser. Informatika, 6, Novosibirsk, 2007, 25–31
[6] Kochetov Yu. A., Paschenko M. G., Plyasunov A. V., “O slozhnosti lokalnogo poiska v zadache o $p$-mediane”, Diskret. analiz i issled. operatsii. Ser. 2, 12:2 (2005), 44–71 | MR
[7] Papadimitriu Kh., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985 | MR
[8] Rastrigin L. A., “Sluchainyi poisk v spetsifika, etapy istorii i predrassudki”, Voprosy kibernetiki, no. 33, Nauchnyi sovet po kompleksnoi probleme “Kibernetika” AN SSSR, M., 1978, 3–16
[9] Aggarwal C. C., Orlin J. B., Tai R. P., “Optimized crossover for maximum independent set”, Oper. Res., 45:2 (1997), 226–243 | DOI | MR
[10] Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P., “A survey of very largescale neighborhood search techniques”, Discrete Appl. Math., 123:1–3 (2002), 75–102 | DOI | MR | Zbl
[11] Balas E., Niehaus W., “Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems”, J. Heuristics, 4:4 (1998), 107–122 | DOI | Zbl
[12] Boese K. D., Kahng A. B., Muddu S., “A new adaptive multi-start technique for combinatorial global optimizations”, Oper. Res. Lett., 16:2 (1994), 101–114 | DOI | MR
[13] Borisovsky P., Dolgui A., Eremeev A., “Genetic algorithms for supply management problem with lower-bounded demands”, Preprints of the 12th IFAC Symposium “Information Control Problems in Manufacturing 2006”, 3, Elsevier Science, Saint-Etienne, France, 2006, 535–540
[14] Bremermann H. J., Roghson J., Salaff S., “Global properties of evolution processes”, Natural automata and useful simulations, Macmillan, London, 1966, 3–42
[15] Glover F., Laguna M., Tabu search, Kluwer Acad. Publ., Boston, 1997 | MR
[16] Goldberg D. E., Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA, 1989
[17] Hanjoul P., Peeters D., “A facility location problem with clients' preference orderings”, Regional Science and Urban Economics, 17:3 (1987), 451–473 | DOI
[18] Hansen P., Mladenovi\' N., “An introduction to variable neighborhood search”, Meta-heuristics: advances and trends in local search paradigms for optimization, Kluwer Acad. Publ., Boston, 1998, 433–458 | MR
[19] Holland J. H., Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, 1975 | MR
[20] Kernighan B. W., Lin S., “An efficient heuristic procedure for partitioning graphs”, Bell Syst. Techn. J., 49 (1970), 291–307 | Zbl
[21] Kochetov Y., Alekseeva E., Levanova T., Loresh M., “Large neighborhood local search for the $p$-median problem”, Yugoslav J. Oper. Res., 15:1 (2005), 53–63 | DOI | MR
[22] Kochetov Yu., Ivanenko D., “Computationally difficult instances for the uncapacitated facility location problem”, Metaheuristics: progress as real solvers, Springer, Berlin, 2005, 351–367
[23] Koutsoupias E., Papadimitriou C., “Worst case equilibria”, Proc. of the 16th annual symposium on theoretical aspects of computer science, Lecture Notes in Comput. Science, 1563, Springer-Verlag, Berlin, 1999, 404–413 | MR | Zbl
[24] Krarup J., Pruzan P. M., “The simple plant location problem: survey and synthesis”, European J. Oper. Res., 12:12 (1983), 36–81 | DOI | MR | Zbl
[25] Resende M., Werneck R., “A hybrid heuristic for the $p$-median problem”, J. Heuristics, 10:1 (2004), 59–88 | DOI | Zbl
[26] Schwefel H. P., Numerical optimization of computer models, Wiley, Chichester, 1981 | Zbl
[27] Tovey C. A., “Local improvement on discrete structures”, Local search in combinatorial optimization, Wiley, Chichester, 1997, 57–90 | MR
[28] Vetta A., “Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions”, Proc. of the 43rd annual IEEE symposium on foundations of computer science (Vancouver, Nevember 16–19, 2002), IEEE Comput. Soc. Press, Los Alamitos, CA, 2006, 416–425