APPROXIMATE TRAVELING SALESMAN ALGORITHMS

[1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[2] TRAVELING SALESMAN PROBLEM - A SURVEY [J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &

[3] CHRISTOFIDES N, 1976, NOV MIAM ORSA TIMS M

[4] Christofides N., 1975, GRAPH THEORY ALGORIT

[5] CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[6] TIGHT BOUNDS FOR CHRISTOFIDES TRAVELING SALESMAN HEURISTIC [J]. MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 116 - 121

[7] Eilon S., 1971, DISTRIBUTION MANAGEM

[8] ALGORITHM-245 - TREESORT 3 [M1] [J]. COMMUNICATIONS OF THE ACM, 1964, 7 (12) : 701 - 701

[9] DATA-STRUCTURES AND COMPUTER SCIENCE TECHNIQUES IN OPERATIONS-RESEARCH [J]. OPERATIONS RESEARCH, 1978, 26 (05) : 686 - 717

[10] GAREY MR, 1976, 8TH P ANN ACM S THEO, P10

[1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[2] TRAVELING SALESMAN PROBLEM - A SURVEY [J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &

[3] CHRISTOFIDES N, 1976, NOV MIAM ORSA TIMS M

[4] Christofides N., 1975, GRAPH THEORY ALGORIT

[5] CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[6] TIGHT BOUNDS FOR CHRISTOFIDES TRAVELING SALESMAN HEURISTIC [J]. MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 116 - 121

[7] Eilon S., 1971, DISTRIBUTION MANAGEM

[8] ALGORITHM-245 - TREESORT 3 [M1] [J]. COMMUNICATIONS OF THE ACM, 1964, 7 (12) : 701 - 701

[9] DATA-STRUCTURES AND COMPUTER SCIENCE TECHNIQUES IN OPERATIONS-RESEARCH [J]. OPERATIONS RESEARCH, 1978, 26 (05) : 686 - 717

[10] GAREY MR, 1976, 8TH P ANN ACM S THEO, P10