Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problème commis voyageur")

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 1894

  • Page / 76
Export

Selection :

  • and

Untersuchungen zu einer Dualisierung des Rundreiseproblems = On a dualization of the travelling salerman problemJEROMIN, B.Wissenschaftliche Zeitschrift der Technischen Universität Dresden. 1990, Vol 39, Num 1, pp 179-182, issn 0043-6925Conference Paper

Aggregation for the probabilistic traveling salesman problemCAMPBELL, Ann Melissa.Computers & operations research. 2006, Vol 33, Num 9, pp 2703-2724, issn 0305-0548, 22 p.Article

Some applications of the clustered travelling salesman problemLAPORTE, G; PALEKAR, U.The Journal of the Operational Research Society. 2002, Vol 53, Num 9, pp 972-976, issn 0160-5682Article

A heuristic circulation-network approach to solve the multi-traveling Salesman problemGARCIA-DIAZ, A.Networks (New York, NY). 1985, Vol 15, Num 4, pp 455-467, issn 0028-3045Article

Traveling-Salesman Problem for a Class of Carrier―Vehicle SystemsGARONE, Emanuele; NALDI, Roberto; CASAVOLA, Alessandro et al.Journal of guidance, control, and dynamics. 2011, Vol 34, Num 4, pp 1272-1276, issn 0731-5090, 5 p.Article

The traveling salesman problemPUNNEN, A.Computers & operations research. 1999, Vol 26, Num 4, issn 0305-0548, 149 p.Serial Issue

On the refinement of bounds of heuristic algorithms for the traveling salesman problemJEROMIN, B; KÖRNER, F.Mathematical programming. 1985, Vol 32, Num 1, pp 114-117, issn 0025-5610Article

Criteria for an optimum simulated annealing schedule for problems of the travelling salesman typeREES, S; BALL, R. C.Journal of physics. A, mathematical and general. 1987, Vol 20, Num 5, pp 1239-1249, issn 0305-4470Article

A new formulation for the travelling salesman problemCLAUS, A.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 1, pp 21-25, issn 0196-5212Article

The multiple traveling salesman problem : an overview of formulations and solution proceduresBEKTAS, Tolga.Omega (Oxford). 2006, Vol 34, Num 3, pp 209-219, issn 0305-0483, 11 p.Article

Problème du voyageur de commerce relaxé : études algorithmiques et polyédralesNachef, Armand; Fonlupt, Jean.1988, 142 p.Thesis

An improved transformation of the symmetric multiple traveling salesman problemJONKER, R; VOLGENANT, T.Operations research. 1988, Vol 36, Num 1, pp 163-167, issn 0030-364XArticle

When is the assignment bound tight for the asymmetric traveling-salesman problem ?FRIEZE, A; KARP, R. M; REED, B et al.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 484-493, issn 0097-5397Article

A new dynamical approach to the travelling Salesman problemBANZHAF, W.Physics letters. A. 1989, Vol 136, Num 1-2, pp 45-51, issn 0375-9601, 7 p.Article

Sur une modification du problème du commis voyageurGERASIMOV, V. A.Avtomatika i telemehanika. 1983, Num 9, pp 161-164, issn 0005-2310Article

Transformation of multidepot multisalesmen problem to the standard travelling salesman problemYANG GUOXING.European journal of operational research. 1995, Vol 81, Num 3, pp 557-560, issn 0377-2217Article

The N-city travelling salesmian probleme statistical mechanics and the Metropolis algorithmBONOMI, E; LUTTON, J.-L.SIAM review (Print). 1984, Vol 26, Num 4, pp 551-568, issn 0036-1445Article

Multispectral Air Pollution Sensor to Characterize of Total Suspended Particulates (TSP) ConcentrationDARAIGAN, S. G; MATJAFRI, M. Z; ABDULLAH, K et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7336, issn 0277-786X, isbn 978-0-8194-7602-9 0-8194-7602-1, 1Vol, 73361O.1-73361O.5Conference Paper

Worst-case analysis of some heuristics for the m-Salesmen problemHOON LIONG ONG; MOORE, J. B.Material flow. 1985, Vol 2, Num 1, pp 203-209, issn 0167-1936Article

Nonoptimal edges for the symmetric traveling salesman problemJONKER, R; VOLGENANT, T.Operations research. 1984, Vol 32, Num 4, pp 837-846, issn 0030-364XArticle

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

  • Page / 76