Bottleneck traveling salesman problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bottleneck traveling salesman problem" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

26^th place

20^th place

6^th place

120^th place

125^th place

archive.org

Kabadi, Santosh N.; Punnen, Abraham P. (2007), "The bottleneck TSP", in Gutin, Gregory; Punnen, Abraham P. (eds.), The Traveling Salesman Problem and Its Variations, Combinatorial Optimization, vol. 12, Springer, pp. 697–735, doi:10.1007/0-306-48213-4_15, ISBN 978-0-387-44459-8.
Gilmore, P. C.; Gomory, R. E. (1964), "Sequencing a one state-variable machine: A solvable case of the traveling salesman problem", Oper. Res., 12 (5): 655–679, doi:10.1287/opre.12.5.655, JSTOR 167772.
Garfinkel, R. S.; Gilbert, K. C. (1978), "The bottleneck traveling salesman problem: Algorithms and probabilistic analysis", Journal of the ACM, 25 (3): 435–448, doi:10.1145/322077.322086, S2CID 12062434.
Parker, R. Garey; Rardin, Ronald L. (1984), "Guaranteed performance heuristics for the bottleneck traveling salesman problem", Operations Research Letters, 2 (6): 269–272, doi:10.1016/0167-6377(84)90077-4.
Hochbaum, Dorit S.; Shmoys, David B. (May 1986), "A unified approach to approximation algorithms for bottleneck problems", Journal of the ACM, 33 (3), New York, NY, USA: ACM: 533–550, doi:10.1145/5925.5933, S2CID 17975253.

Gilmore, P. C.; Gomory, R. E. (1964), "Sequencing a one state-variable machine: A solvable case of the traveling salesman problem", Oper. Res., 12 (5): 655–679, doi:10.1287/opre.12.5.655, JSTOR 167772.

Garfinkel, R. S.; Gilbert, K. C. (1978), "The bottleneck traveling salesman problem: Algorithms and probabilistic analysis", Journal of the ACM, 25 (3): 435–448, doi:10.1145/322077.322086, S2CID 12062434.
Hochbaum, Dorit S.; Shmoys, David B. (May 1986), "A unified approach to approximation algorithms for bottleneck problems", Journal of the ACM, 33 (3), New York, NY, USA: ACM: 533–550, doi:10.1145/5925.5933, S2CID 17975253.