TRANSFORMATION OF MULTISALESMEN PROBLEM TO THE STANDARD TRAVELING SALESMAN PROBLEM.BELLMORE M; HONG S.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 500-504; BIBL. 4 REF.Article

THE CLUSTERED TRAVELING SALESMAN PROBLEM.CHISMAN JA.1975; COMPUTERS OPER. RES.; G.B.; DA. 1975; VOL. 2; NO 2; PP. 115-119; BIBL. 11 REF.Article

SUR UN PROCEDE D'APPROXIMATION DES SOLUTIONS DU PROBLEME DU COMMIS-VOYAGEURMININA TR; PEREKREST VT.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 220; NO 1; PP. 31-34; BIBL. 9 REF.Article

ANALYTISCHER VERGLEICH DER MANUELL-RECHNERISCHEN LOESUNG EINIGER VERFAHREN DES RUNDFAHRTPROBLEMS = COMPARAISON ANALYTIQUE DE DIVERSES METHODES DE RESOLUTION MANUELLE DU PROBLEME DE TOURNEEKNOEFLER KH.1972; HEBEZEUGE FOERDERMITTEL; DTSCH.; DA. 1972; VOL. 12; NO 11; PP. 333-336; ABS. RUSSE ANGL.; BIBL. 9 REF.Serial Issue

CLUSTERING A DATA ARRAY AND THE TRAVELING-SALESMAN PROBLEM.LENSTRA JK.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 413-414; BIBL. 5 REF.Article

ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMSCHRISTOFIDES N; EILON S.1972; OPER. RES. QUART.; G.B.; DA. 1972; VOL. 23; NO 4; PP. 511-518; BIBL. 10 REF.Serial Issue

THE GREEDY TRAVELLING SALESMAN'S PROBLEMJENKYNS TA.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 4; PP. 363-373; BIBL. 4 REF.Article

PAIRS OF ADJACENT HAMILTONIAN CIRCUITS WITH SMALL INTERSECTIONWEST DB.1978; STUD. APPL. MATH.; USA; DA. 1978; VOL. 59; NO 3; PP. 245-248; BIBL. 8 REF.Article

A SIMULTANEOUS ENUMERATION APPROACH TO THE TRAVELLING SALESMAN PROBLEM.CLAUS A.1978; STUDY APPL. MATH.; U.S.A.; DA. 1978; VOL. 58; NO 2; PP. 159-163; BIBL. 7 REF.Article

THE TRAVELLING SALESMAN PROBLEM AND A CLASS OF POLYHEDRA OF DIAMETER TWO.PADBERG MW; RAO MR.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 7; NO 1; PP. 32-45; BIBL. 22 REF.Article

APPROCHE BARYCENTRIQUE PAR TRANSFORMATION DE FOURIER D'UNE CLASSE DE PROBLEMES DE PLACEMENT ET DE TRANSPORT.DEPEYROT M.1974; C.R. ACAD. SCI., A; FR.; DA. 1974; VOL. 279; NO 23; PP. 823-826; BIBL. 5 REF.Article

UNE GENERALISATION DU PROBLEME DE DEUX COMMIS VOYAGEURSSIKHARULIDZE GG.1972; SOOBSHCH. AKAD. NAUK GRUZ. S.S.R.; S.S.S.R.; DA. 1972; VOL. 66; NO 3; PP. 653-656; ABS. GEORGIEN ANGL.; BIBL. 2 REF.Serial Issue

SUR LES VALEURS POSSIBLES D'UNE FONCTIONNELLE DANS LES PROBLEMES SPECIAUX DU COMMIS VOYAGEURDEJNEKO VG; TROFIMOV VN.1981; KIBERNETIKA; UKR; DA. 1981; NO 6; PP. 135-136; BIBL. 6 REF.Article

IMPROVED LOWER BOUNDS TO THE TRAVELLING SALESMAN PROBLEMD'ATRI G.1978; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1978; VOL. 12; NO 4; PP. 369-382; BIBL. 20 REF.Article

A NOTE ON THE TRAVELING SALESMAN PROBLEM.JONES L.1977; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1977; VOL. 32; NO 1; PP. 220-222Article

CONSTRUCTION DES CYCLES HAMILTONIENS OPTIMAUX DANS LES GRAPHES A PLUSIEURS SOMMETSZAJTSEVA ZH N; SHTEJN ME.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 6; PP. 143-145; ABS. ANGL.; BIBL. 7 REF.Article

STABILITE DU PROBLEME DU COMMIS-VOYAGEURLEONT'EV VK.1975; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1975; VOL. 15; NO 5; PP. 1298-1309; BIBL. 5 REF.Article

ON THE COMPLEXITY OF THE MARRIAGE PROBLEMHARPER LH; SAVAGE JE.1972; ADV. IN MATH.; U.S.A.; DA. 1972; VOL. 9; NO 3; PP. 299-312; BIBL. 5 REF.Serial Issue

A BISECTION METHOD FOR THE TRAVELING SALESMAN PROBLEM.SYSLO MM.1977; ZASTOSOW. MAT.; POLSKA; DA. 1977; VOL. 16; NO 1; PP. 59-62; ABS. POL.; BIBL. 7 REF.Article

ADJACENCY OF THE TRAVELING SALESMAN TOURS AND 0-1 VERTICES. = PROXIMITE DES TOURNEES DU VOYAGEUR DE COMMERCE ET DES RESEAUX 0-1RAO MR.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 30; NO 2; PP. 191-198; BIBL. 12 REF.Article

IMPROVEMENTS OF THE HELD-KARP ALGORITHM FOR THE SYMMETRIC TRAVELING-SALESMAN PROBLEM.HELBIG HANSEN K; KRARUP J.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 7; NO 1; PP. 87-96; BIBL. 7 REF.Article

METHODE DE RESOLUTION DE QUELQUES PROBLEMES EXTREMAUX DE TYPE COMBINATOIREPLOTNIKOV VN; GALKIN AV.1974; KIBERN. VYCHISLIT. TEKH., U.S.S.R.; S.S.S.R.; DA. 1974; NO 23; PP. 81-84; BIBL. 3 REF.Article

ALGORITHMEN FUER DAS KLASSISCHE MASCHINENBELEGUNGSPROBLEM = ALGORITHME POUR LE PROBLEME DU VOYAGEUR DE COMMERCETERNO J.1972; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1972; VOL. 3; NO 3; PP. 195-201; ABS. ANGL. RUSSE; BIBL. 4 REF.Serial Issue

SUR LA SOLUTION DU PROBLEME DU COMMIS-VOYAGEURTELEMTAEV MM.1972; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1972; PP. 94-100; BIBL. 5 REF.Serial Issue

ON THE EXPECTED NUMBER OF OPTIMAL AND NEAR-OPTIMAL SOLUTIONS TO THE EUCLIDEAN TRAVELLING SALESMAN PROBLEMAKL SG.1981; J. COMPUT. APPL. MATH.; ISSN 0377-0427; BEL; DA. 1981; VOL. 7; NO 4; PP. 287-288; BIBL. 5 REF.Article