Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("TRAVELLING SALESMAN PROBLEM")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1842

  • Page / 74
Export

Selection :

  • and

AN N-CONSTRAINT FORMULATION OF THE (TIME-DEPENDENT) TRAVELING SALESMAN PROBLEMFOX KR; GAVISH B; GRAVES SC et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 4; PP. 1018-1021; BIBL. 7 REF.Article

EIN BEITRAG ZUR LOESUNG SPEZIELLER TOURENPROBLEME MIT SYMMETRISCHER ENTFERNUNGSMATRIX = CONTRIBUTION A LA RESOLUTION DE PROBLEMES DE COMMIS VOYAGEURS PARTICULIERS AVEC UNE MATRICE DE DISTANCE SYMETRIQUEGRUNDMANN W; KRAUSE H.1978; WISSENSCH. Z. HOCHSCH. ARCHIT. BAUWES. WEIMAR; DDR; DA. 1978; VOL. 25; NO 3; PP. 253-256; BIBL. 4 REF.Article

ZU VERSCHAERFUNGEN DER CHRISTOFIDES-SCHRANKE FUER DEN WERT EINER OPTIMALEN TOUR DES RUNDREISEPROBLEMS = SUR L'AMELIORATION DE LA BORNE DE CHRISTOFIDES POUR LA VALEUR D'UN TOUR OPTIMAL DU PROBLEME DU COMMIS-VOYAGEURJEROMIN B; KOERNER F.1982; MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1982; VOL. 13; NO 3; PP. 359-371; ABS. ENG/RUS; BIBL. 9 REF.Article

EIN BEITRAG ZUR KLASSIFIZIERUNG VON RUNDREISEPROBLEMEN = CLASSIFICATION DES PROBLEMES DE TOURNEESSCHIEBEL W; TERNO J; UNGER G et al.1979; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1979; VOL. 10; NO 4; PP. 523-528; ABS. ENG/RUS; BIBL. 14 REF.Article

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

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

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

APPLICATION D'UN PROGRAMME EVOLUTIF A LA RESOLUTION DU PROBLEME DU COMMIS VOYAGEURIRODOV VF; MAKSIMENKOV VP.1981; AVTOMATIKA; UKR; DA. 1981; NO 4; PP. 10-14; ABS. ENG; BIBL. 5 REF.Article

GENERALIZATIONS OF THE STANDARD TRAVELLING SALESMAN PROBLEMSYSLO MM.1980; ZASTOSOW. MAT.; POL; DA. 1980; VOL. 16; NO 4; PP. 621-629; ABS. POL; BIBL. 12 REF.Article

ON THE SYMMETRIC TRAVELLING SALESMAN PROBLEM: SOLUTION OF A 120-CITY PROBLEMGROETSCHEL M.1980; MATH. PROGRAMMG STUDY; NLD; DA. 1980; NO 12; PP. 61-77; BIBL. 15 REF.Article

ROUNDING SYMMETRIC TRAVELING SALESMAN PROBLEMS WITH AN ASYMMETRIC ASSIGNMENT PROBLEMJONKER R; DE LEVE G; VAN DER VELDE JA et al.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 623-627; BIBL. 5 REF.Article

PROCEDURES FOR TRAVELLING SALESMAN PROBLEMS WITH ADDITIONAL CONSTRAINTSLOKIN FCJ.1979; EUROP. J. OPERAT. RES.; NLD; DA. 1979; VOL. 3; NO 2; PP. 135-141; BIBL. 4 REF.Article

A PREFERENCE ORDER DYNAMIC PROGRAM FOR A KNAPSACK PROBLEM WITH STOCHASTIC REWARDSSTEINBERG E; PARKS MS.1979; J. OPERAT. RES. SOC.; GBR; DA. 1979; VOL. 30; NO 2; PP. 141-147; BIBL. 25 REF.Article

ON THE SOLUTIONS OF STOCHASTIC TRAVELING SALESMAN PROBLEMSLEIPALA T.1978; EUROP. J. OPERAT. RES.; NLD; DA. 1978; VOL. 2; NO 4; PP. 291-297; BIBL. 18 REF.Article

THE ADJACENCY RELATION ON THE TRAVELING SALESMAN POLYTOPE IS NP-COMPLETEPAPADIMITRIOU CH.1978; MATH. PROGRAMMG; NLD; DA. 1978; VOL. 14; NO 3; PP. 312-324; BIBL. 25 REF.Article

THE HELD-KARP ALGORITHM AND DEGREE-CONSTRAINED MINIMUM 1-TREESYAMAMOTO Y.1978; MATH. PROGRAMMG; NLD; DA. 1978; VOL. 15; NO 2; PP. 228-231; BIBL. 10 REF.Article

CAS SPECIAL DU PROBLEME DU VOYAGEUR DE COMMERCEDEMIDENKO VM.1976; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1976; NO 5; PP. 28-32; BIBL. 12 REF.Article

ALGORITHME EFFECTIF POUR LE PROBLEME DU COMMIS-VOYAGEURCHALYKOV VP.1975; GOD. VISSH. UCHEBNI ZAVED., PRILOZH. MAT.; BALG.; DA. 1975 PARU 1977; VOL. 11; NO 4; PP. 177-189; ABS. RUSSE ANGL.; BIBL. 7 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

A NEW EXTENSION PRINCIPLE ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM = UN NOUVEL ALGORITHME BASE SUR LE PRINCIPE D'EXTENSION POUR LE PROBLEME DU VOYAGEUR DE COMMERCESCHEITHAUER G; TERNO J.1982; MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1982; VOL. 13; NO 2; PP. 231-245; ABS. GER/RUS; BIBL. 14 REF.Article

KOMBINATORICKA METODA RESENI OKRUZNICH DOPRAVNICH ULOH = UN ALGORITHME COMBINATOIRE POUR LES PROBLEMES DE COMMIS-VOYAGEURS A M-TOURNEESMARTINEC I.1979; EKON.-MAT. OBZ.; CSK; DA. 1979; VOL. 15; NO 3; PP. 320-341; ABS. ENG; BIBL. 14 REF.Article

SUR UN PROBLEME D'ALLOCATION OPTIMALE DE RESSOURCESALEKSEEV QG; MERZHANOV V YU.1979; KIBERNETIKA; UKR; DA. 1979; NO 6; PP. 67-72; ABS. ENG; BIBL. 4 REF.Article

  • Page / 74