Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problema viajante comercio")

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 1051

  • Page / 43
Export

Selection :

  • and

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

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

The general routing polyhedron : A unifying frameworkLETCHFORD, A. N.European journal of operational research. 1999, Vol 112, Num 1, pp 122-133, issn 0377-2217Article

The capacitated traveling salesman problem with pickups and deliveries on a treeLIM, Andrew; FAN WANG; ZHOU XU et al.Lecture notes in computer science. 2005, pp 1061-1070, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

A travelling salesman problem in the k-dimensional unit cubeBOLLOBAS, B; MEIR, A.Operations research letters. 1992, Vol 11, Num 1, pp 19-21, issn 0167-6377Article

The facets of the asymmetric S-city traveling salesman polytopeBARTELS, H. G; BARTELS, S. G.Zeitschrift für Operations Research. 1989, Vol 33, Num 3, pp 193-197, issn 0373-790X, 5 p.Article

Constrained TSP and low-power computingCHARIKAR, M; MOTWANI, R; RAGHAVAN, P et al.Lecture notes in computer science. 1997, pp 104-115, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A priori bounds of the euclidean traveling salesmanSNYDER, T. L; STEELE, J. M.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 665-671, issn 0097-5397Article

Scaling the neural TSP algorithmCUYKENDALL, R; REESE, R.Biological cybernetics. 1989, Vol 60, Num 5, pp 365-371, issn 0340-1200, 7 p.Article

Utilizing traveling-salesman subtours to create sales districtsFEIRING, B. R.Engineering costs and production economics. 1986, Vol 10, Num 3, pp 211-215, issn 0167-188XArticle

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

Not every GTSP facet induces an STSP facetOSWALD, Marcus; REINELT, Gerhard; THEIS, Dirk Oliver et al.Lecture notes in computer science. 2005, pp 468-482, issn 0302-9743, isbn 3-540-26199-0, 15 p.Conference Paper

Parameter setting of the Hopfield network applied to TSPTALAVAN, Pedro M; YANEZ, Javier.Neural networks. 2002, Vol 15, Num 3, pp 363-373, issn 0893-6080Article

The monotonic diameter of traveling salesman polytopesRISPOLI, F. J.Operations research letters. 1998, Vol 22, Num 2-3, pp 69-73, issn 0167-6377Article

Relaxed tours and path ejections for the traveling salesman problemREGO, C.European journal of operational research. 1998, Vol 106, Num 2-3, pp 522-538, issn 0377-2217Article

The random link approximation for the Euclidean traveling salesman problemCERF, N. J; BOUTET DE MONVEL, J; BOHIGAS, O et al.Journal de physique. I. 1997, Vol 7, Num 1, pp 117-136, issn 1155-4304Article

Global bifurcation structure of chaotic neural networks and its application to traveling salesman problemsTOKUDA, I; NAGASHIMA, T; AIHARA, K et al.Neural networks. 1997, Vol 10, Num 9, pp 1673-1690, issn 0893-6080Article

A new extension of local search applied to the Dial-A-Ride problemHEALY, P; MOLL, R.European journal of operational research. 1995, Vol 83, Num 1, pp 83-104, issn 0377-2217Article

Lot sizing in a no-wait flow shopEMMONS, H; KAMLESH MATHUR.Operations research letters. 1995, Vol 17, Num 4, pp 159-164, issn 0167-6377Article

Genetically improved presequences for Euclidean Traveling Salesman ProblemsTATE, D. M; TUNASAR, C; SMITH, A. E et al.Mathematical and computer modelling. 1994, Vol 20, Num 2, pp 135-143, issn 0895-7177Article

Crossover on intensive search and traveling salesman problemRUNWEI CHENG; GEN, M.Computers & industrial engineering. 1994, Vol 27, Num 1-4, pp 485-488, issn 0360-8352Conference Paper

Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are usedGUENOV, M.European journal of operational research. 1992, Vol 58, Num 1, pp 37-47, issn 0377-2217Article

Rectifiable sets and the Traveling Salesman ProblemJONES, P. W.Inventiones mathematicae. 1990, Vol 102, Num 1, pp 1-15, issn 0020-9910, 15 p.Article

  • Page / 43