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

THE GREEDY TRAVELLING SALESMAN'S PROBLEMJENKYNS TA.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 4; PP. 363-373; BIBL. 4 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

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

A NOTE ON THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM WITH FIXED CHARGES.HONG S; PADBERG MW.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 5; PP. 871-874; BIBL. 3 REF.Article

A MORE COMPACT FORMULATION OF THE SYMMETRIC MULTIPLE TRAVELLING SALESMAN PROBLEM WITH FIXED CHARGESDISCENZA JH.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 73-75; BIBL. 1 REF.Article

A NOTE ON THE MULTIPLE TRAVELING SALESMEN PROBLEMRAO MR.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 628-632; BIBL. 2 REF.Article

THE TRAVELING SALESMAN LOCATION PROBLEM.BURNESS RC; WHITE JA.1976; TRANSPORT. SCI.; U.S.A.; DA. 1976; VOL. 10; NO 4; PP. 348-360; BIBL. 14 REF.Article

ON THE WORST-CASE PERFORMANCE OF SOME ALGORITHMS FOR THE ASYMMETRIC TRAVELLING SALESMAN PROBLEMFRIEZE AM; GALBIATI G; MAFFIOLI F et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 1; PP. 23-39; BIBL. 28 REF.Article

LOCAL SEARCH FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEMKANELLAKIS PC; PAPADIMITRIOU CH.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1086-1099; BIBL. 23 REF.Article

ON THE SYMMETRIC TRAVELLING SALESMAN PROBLEM: A COMPUTATIONAL STUDYPADBERG MW.1980; MATH. PROGRAMMG STUDY; NLD; DA. 1980; NO 12; PP. 78-107; BIBL. 21 REF.Article

ON THE SYMMETRIC TRAVELLING SALESMAN PROBLEM. I: INEQUALITIESGROTSCHEL M; PADBERG MW.1979; MATH. PROGRAMMG; NLD; DA. 1979; VOL. 16; NO 3; PP. 265-280; BIBL. 29 REF.Article

ON THE SYMMETRIC TRAVELLING SALESMAN PROBLEM. II: LIFTING THEOREMS AND FACETSGROTSCHEL M; PADBERG MW.1979; MATH. PROGRAMMG; NLD; DA. 1979; VOL. 16; NO 3; PP. 281-302; BIBL. 5 REF.Article

HYPO-HAMILTONIAN FACETS OF THE SYMMETRIC TRAVELLING SALESMAN POLYTOPEGROTSCHEL M.1978; Z. ANGEW. MATH. MECH.; DDR; DA. 1978; VOL. 58; NO 7; PP. 469-471; BIBL. 8 REF.Article

APPLICATIONS OF COMBINATORIAL PROGRAMMING TO DATA ANALYSIS: THE TRAVELING SALESMAN AND RELATED PROBLEMS.HUBERT LJ; BAKER FB.1978; PSYCHOMETRIKA; USA; DA. 1978; VOL. 43; NO 1; PP. 81-91; BIBL. 2 P. 1/2Article

SUR LA COMPLEXITE DU PROBLEME DU COMMIS VOYAGEUR DANS LA CLASSE DES ALGORITHMES AVEC AMELIORATION MONOTONEVIZING VG.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 4; PP. 142-144; ABS. ANGL.; BIBL. 3 REF.Article

Exact solution of the generalized routing problem through graph transformationsBLAIS, M; LAPORTE, G.The Journal of the Operational Research Society. 2003, Vol 54, Num 8, pp 906-910, issn 0160-5682, 5 p.Article

ORDER-PICKING IN A RECTANGULAR WAREHOUSE: A SOLVABLE CASE OF THE TRAVELLING SALESMAN PROBLEMRATLIFF HD; ROSENTHAL AS.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 3; PP. 507-521; BIBL. 3 REF.Article

IDENTIFICATION OF NON-OPTIMAL ARCS FOR THE TRAVELLING SALESMAN PROBLEM = IDENTIFICATION DES ARCS NON OPTIMAUX POUR LE PROBLEME DU VOYAGEUR DE COMMERCEJONKER R; VOLGENANT T.1982; OPER. RES. LETT.; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 3; PP. 85-88; BIBL. 4 REF.Article

ANALYSE DE LA SOLUTION A GRADIENT DU PROBLEME DU COMMIS-VOYAGEURKOVALEV MM; KOTOV VM.1981; Z. VYCISL. MAT. MAT. FIZ.; ISSN 0044-4669; SUN; DA. 1981; VOL. 21; NO 4; PP. 1035-1038; BIBL. 11 REF.Article

A TRAVELLING SALESMAN PROBLEM: BRANCH AND BOUND TECHNIQUEKHARE AK; DAVE RK.1981; J. INSTIT. ENGRS (INDIA), MECH. ENGNG DIV.; IND; DA. 1981; VOL. 61; NO 4; PP. 121-125; BIBL. 4 REF.Article

USING MULTIDIMENSIONAL SCALING TO SOLVE TRAVELING SALESMAN AND MACHINE SCHEDULING PROBLEMSWHITE GP; SWEENEY DJ.1980; COMPUTERS OPER. RES.; GBR; DA. 1980; VOL. 7; NO 3; PP. 177-184; BIBL. 11 REF.Article

ETUDE EXPERIMENTALE DE L'EFFICACITE DES ALGORITHMES HEURISTIQUES DE RESOLUTION DU PROBLEME DU COMMIS VOYAGEURBORODIN VV; LOVETSKIJ SE; MELAMED II et al.1980; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1980; NO 11; PP. 76-84; ABS. ENG; BIBL. 16 REF.Article

TIGHT BOUNDS FOR CHRISTOFIDES' TRAVELING SALESMAN HEURISTIC.CORNUEJOLS G; NEMHAUSER GL.1978; MATH. PROGRAMMG; NETHERL.; DA. 1978; VOL. 14; NO 1; PP. 116-121; BIBL. 1 REF.Article