THE TRAVELING SALESMAN PROBLEM .1. THEORETICAL ISSUES

[1] THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1986, 20 (01): : 79 - 87

[2] STRONG SUFFICIENT CONDITIONS FOR THE EXISTENCE OF HAMILTONIAN CIRCUITS IN UNDIRECTED GRAPHS [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (03) : 339 - 343

[3] Akiyama T., 1980, Journal of Information Processing, V3, P73

[4] AMOUR RS, 1983, AM J PHYS, V51, P405

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

[6] [Anonymous], 1976, DISCRETE MATH MODELS

[7] [Anonymous], 1979, AVTOMAT TELEMEKH

[8] [Anonymous], 1962, THEORY GRAPHS

[9] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46

[10] TRANSFORMATION OF MULTISALESMEN PROBLEM TO STANDARD TRAVELLING SALESMAN PROBLEM [J]. JOURNAL OF THE ACM, 1974, 21 (03) : 500 - 504

[1] THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1986, 20 (01): : 79 - 87

[2] STRONG SUFFICIENT CONDITIONS FOR THE EXISTENCE OF HAMILTONIAN CIRCUITS IN UNDIRECTED GRAPHS [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (03) : 339 - 343

[3] Akiyama T., 1980, Journal of Information Processing, V3, P73

[4] AMOUR RS, 1983, AM J PHYS, V51, P405

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

[6] [Anonymous], 1976, DISCRETE MATH MODELS

[7] [Anonymous], 1979, AVTOMAT TELEMEKH

[8] [Anonymous], 1962, THEORY GRAPHS

[9] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46

[10] TRANSFORMATION OF MULTISALESMEN PROBLEM TO STANDARD TRAVELLING SALESMAN PROBLEM [J]. JOURNAL OF THE ACM, 1974, 21 (03) : 500 - 504