Algorithms for solving the two-criterion large-scale travelling salesman problem

I. Kh. Sigal

Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 1, pp. 44-57

Bibliographie

[1] Emelichev V. A., Perepelitsa V. A., “K vychislitelnoi slozhnosti diskretnykh mnogokriterialnykh zadach”, Izv. AN SSSR. Tekhn. kibernetika, 1988, no. 1, 78–85 | Zbl

[2] Melamed I. I., “Metody optimizatsii v transportnom protsesse”, Itogi nauki i tekhn. Organizatsiya upravleniya transportom, 10, VINITI, M., 1991

[3] Khachaturov V. R., Matematicheskie metody regionalnogo programmirovaniya, Nauka, Fizmatgiz, M., 1989 | MR | Zbl

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

[5] Sigal I. X., Diskretnye modeli i metody resheniya zadach tipa kommivoyazhera bolshoi razmernosti: issledovanie, kombinirovannye algoritmy, vychislitelnyi eksperiment, primeneniya, Dis. $\dots$ dokt. tekhn. nauk, VTs AN SSSR, M., 1990

[6] Khachaturov V. R., Sigal I. H., Veselovskii V. E., Zlotov A. V., “The combinatorial algorithms for large scale discrete optimization problems”, Inform. Teehnol. and Economic Modelling, Techn. Res. Centre Finland, ESPOO, Helsinki, 1992, 226–236

[7] Mandel I. D., Klasternyi analiz, Finansy i statistika, M., 1988 | MR

[8] Rubinshtein M. I., Optimalnaya gruppirovka vzaimosvyazannykh ob'ektov, Nauka, M., 1989 | MR

[9] Sigal I. X., “Algoritm priblizhennogo resheniya zadachi kommivoyazhera bolshoi razmernosti i ego vychislitelnaya realizatsiya”, Zh. vychisl. matem. i matem. fiz., 27:8 (1987), 1145–1153 | MR | Zbl

[10] Sigal I. X., “Dekompozitsionnyi podkhod k resheniyu zadachi kommivoyazhera bolshoi razmernosti i nekotorye ego prilozheniya”, Izv. AN SSSR. Tekhn. kibernetika, 1990, no. 6, 143–155 | MR | Zbl

[11] Sigal I. X., Zadacha kommivoyazhera bolshoi razmernosti, VTs AN SSSR, M., 1986

[12] Sigal I. X., Kombinirovannye algoritmy resheniya zadachi kommivoyazhera, VTs AN SSSR, M., 1985 | MR

[13] Sigal I. X., Algoritmy i dialogovaya sistema dlya resheniya zadachi kommivoyazhera bolshoi razmernosti na ploskosti, VTs AN SSSR, M., 1988 | MR

[14] Sigal I. X., “Algoritmy priblizhennogo resheniya zadachi kommivoyazhera bolshoi razmernosti na ploskosti”, Zh. vychisl. matem. i matem. fiz., 28:8 (1988), 1268–1272 | MR | Zbl

[15] Sigal I. X., “Algoritm resheniya zadachi o kommivoyazhere s otsenkoi tochnosti”, Algoritmy i algoritmich. yazyki, 6, VTs AN SSSR, M., 1973, 49–61

[16] Sigal I. X., “Vychislitelnaya realizatsiya kombinirovannogo algoritma vetvei i granits dlya zadachi kommivoyazhera”, Zh. vychisl. matem. i matem. fiz., 26:5 (1986), 664–672 | MR | Zbl

[17] Sigal I. X., “Posledovatelnyi analiz variantov pri reshenii ekstremalnykh zadach”, Sistemy raspredeleniya resursov na grafakh, VTs AN SSSR, M., 1970, 63–84 | MR

[18] Sigal I. X., “Posledovatelnost primeneniya algoritmov priblizhennogo resheniya v kombinirovannom algoritme resheniya zadachi kommivoyazhera”, Zh. vychisl. matem. i matem. fiz., 29:11 (1989), 1714–1721 | MR | Zbl

[19] Preparata F., Sheimos M., Vychislitelnaya geometriya: Vvedenie, Mir, M., 1989 | MR | Zbl

[20] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR

[21] Gribov A. B., “Rekursivnoe reshenie transportnykh zadach lineinogo programmirovaniya”, Vestn. LGU, 1978, no. 4(19), 11–19 | Zbl

[22] Lentsevichyus R. A., Razrabotka i issledovanie grafo-topologicheskikh algoritmov pokoordinatnogo metoda dlya resheniya setevykh zadach diskretnoi optimizatsii, Dis. $\dots$ kand. tekhn. nauk, IFTPE. AM LitSSR, Kaunas, 1984

[23] Lin S., Kernighan B. W., “An effective heuristic algorithm for the travelling salesman problem”, Operat. Res., 21:2 (1973), 498–516 | DOI | MR | Zbl

[24] Zadorozhnyi M. V., Sokolovskii V. 3., Reshenie zadachi kommivoyazhera po metodu suzhayuschikhsya okrestnostei., Dep. v VINITI 12.01/82, No 163-82, In-t probl. mashinostr. AN USSR, Kharkov, 1981

[25] Sokolovskii V. M., Kukharenok M. A., “Metod suzhayuschikhsya okrestnostei: realizatsiya, testirovanie, prilozheniya”, Ekonomika i matem. metody, 21:6 (1985), 1092–1102 | MR

[26] Padberg M. W., Hong S., “On the symmetric travelling salesman problem: a computational study”, Math. Program. Study, 12 (1980), 78–107 | MR | Zbl

[27] E. L. Lawler (eds.), The travelling salesman problem, Wiley, N. Y., 1985 | MR | Zbl

[28] Lentsevichyus P. A., “Strukturnyi grafo-topologicheskii podkhod k resheniyu zadachi kommivoyazhera”, Tezisy dokl. XXVII konf. Litovskogo matem. ob-va (Vilnyus, 1986), 135–136

[29] Padberg M., Rinaldi C., “Optimization a 532-city symmetric travelling salesman problem by branch and cut”, Operat. Res. Leetts, 6:1 (1987), 1–7 | DOI | MR | Zbl

[30] Padberg M., Rinaldi C., “Optimization a 532-city symmetric travelling salesman problem by branch and cut”, Operat. Res. Letts, 9 (1990), 353 | DOI | MR

[31] Schnetzler B., “Des opérateurs d'échange et une méthode de relaxation pour le problème du voyager de commerce”, Rech. Operat., 26:1 (1992), 57–81 | Zbl