Geodesic
Little's method with optimal reduction of a matrix
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 148 (2006) no. 4, pp. 13-22 
I. F. Borkhanov; V. R. Fazylov. Little's method with optimal reduction of a matrix. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 148 (2006) no. 4, pp. 13-22. http://geodesic.mathdoc.fr/item/UZKU_2006_148_4_a1/
@article{UZKU_2006_148_4_a1,
     author = {I. F. Borkhanov and V. R. Fazylov},
     title = {Little's method with optimal reduction of a~matrix},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {13--22},
     year = {2006},
     volume = {148},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2006_148_4_a1/}
}
TY  - JOUR
AU  - I. F. Borkhanov
AU  - V. R. Fazylov
TI  - Little's method with optimal reduction of a matrix
JO  - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
PY  - 2006
SP  - 13
EP  - 22
VL  - 148
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/UZKU_2006_148_4_a1/
LA  - ru
ID  - UZKU_2006_148_4_a1
ER  - 
%0 Journal Article
%A I. F. Borkhanov
%A V. R. Fazylov
%T Little's method with optimal reduction of a matrix
%J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
%D 2006
%P 13-22
%V 148
%N 4
%U http://geodesic.mathdoc.fr/item/UZKU_2006_148_4_a1/
%G ru
%F UZKU_2006_148_4_a1

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

In this paper are considered application traditional and optimum reduction of a matrix in Little's method for asymmetrical problem of the traveling salesman representative. On a number of test problems high efficiency of optimum reduction is shown.

[1] Akof R., Sasieni M., Osnovy issledovaniya operatsii, Mir, M., 1971, 534 pp. | MR

[2] Konvei R. V., Maksvell V. L., Miller L. V., Teoriya raspisanii, Nauka, M., 1975, 359 pp. | MR

[3] Borkhanov I. F., Fazylov V. R., “Ob optimalnom privedenii matritsy stoimostei”, Uch. zap. Kazan. un-ta. Ser. Fiz.-matem.nauki, 148, kn. 2 (2006), 18–22 | Zbl

[4] Munkres J., “Algorithms for the assignment and transportation problems”, J. SIAM, 5:1 (1957), 32–38 | DOI | MR

[5] Jin Kue Wong, “A new implementation of an algorithm for the optimal assignment problem: an improved version of Munkres' algorithm”, BIT Numerical Mathematics, 19:3, 418–424 | MR | Zbl

[6] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978, 432 pp. | MR

[7] Reingold E., Nivergelt Yu., Deo N., Kombinatornye algoritmy. Teoriya i praktika, Mir, M., 1970, 476 pp. | MR

[8] Cirasella J., Johnson D. S., McGeoch L. A., Zhang W., “The asymmetric travelling salesman problem: algorithms, instance generators, and tests”, ALENEX, 2153 (2001), 32–59 | Zbl