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

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

A transformation for the mixed general routing problem with turn penaltiesSOLER, D; MARTINEZ, E; MICO, J. C et al.The Journal of the Operational Research Society. 2008, Vol 59, Num 4, pp 540-547, issn 0160-5682, 8 p.Article

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

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

On the core of multiple longest traveling salesman gamesESTEVEZ-FERNANDEZ, Arantza; BORM, Peter; HAMERS, Herbert et al.European journal of operational research. 2006, Vol 174, Num 3, pp 1816-1827, issn 0377-2217, 12 p.Article

Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networksMULDER, Samuel A; WUNSCH, Donald C.Neural networks. 2003, Vol 16, Num 5-6, pp 827-832, issn 0893-6080, 6 p.Conference Paper

On the graphical relaxation of the symmetric traveling salesman polytopeOSWALD, Marcus; REINELT, Gerhard; THEIS, Dirk Oliver et al.Mathematical programming. 2007, Vol 110, Num 1, pp 175-193, issn 0025-5610, 19 p.Conference Paper

A neural network algorithm for the traveling salesman problem with backhaulsGHAZIRI, Hassan; OSMAN, Ibrahim H.Computers & industrial engineering. 2003, Vol 44, Num 2, pp 267-281, issn 0360-8352, 15 p.Article

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-completeBERBEGLIA, Gerardo; HAHN, Gena.Discrete applied mathematics. 2009, Vol 157, Num 11, pp 2541-2547, issn 0166-218X, 7 p.Article

A better differential approximation ratio for symmetric TSPESCOFFIER, Bruno; MONNOT, Jérome.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 63-70, issn 0304-3975, 8 p.Article

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraintsSARIN, Subhash C; SHERALI, Hanif D; BHOOTRA, Ajay et al.Operations research letters. 2005, Vol 33, Num 1, pp 62-70, issn 0167-6377, 9 p.Article

35/44-approximation for Asymmetric Maximum TSP with Triangle InequalityKOWALIK, Lukasz; MUCHA, Marcin.Algorithmica. 2011, Vol 59, Num 2, pp 240-255, issn 0178-4617, 16 p.Article

A new asymmetric pyramidally solvable class of the traveling salesman problemMOHAMMED FAZLE BAKI.Operations research letters. 2006, Vol 34, Num 6, pp 613-620, issn 0167-6377, 8 p.Article

Efficient neighborhood search for the probabilistic pickup and delivery travelling salesman problemBERALDI, Patrizia; GHIANI, Gianpaolo; LAPORTE, Gilbert et al.Networks (New York, NY). 2005, Vol 45, Num 4, pp 195-198, issn 0028-3045, 4 p.Article

3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problemRATHINAM, Sivakumar; SENGUPTA, Raja.Operations research letters. 2010, Vol 38, Num 1, pp 63-68, issn 0167-6377, 6 p.Article

Certification of an optimal TSP tour through 85,900 citiesAPPLEGATE, David L; BIXBY, Robert E; CHVATAL, Vasek et al.Operations research letters. 2009, Vol 37, Num 1, pp 11-15, issn 0167-6377, 5 p.Article

Robotic-cell scheduling : Special polynomially solvable cases of the traveling salesman problem on permuted monge matricesDEINEKO, Vladimir G; STEINER, George; ZHIHUI XUE et al.Journal of combinatorial optimization. 2005, Vol 9, Num 4, pp 381-399, issn 1382-6905, 19 p.Article

Lin-Kernighan heuristic adaptations for the generalized traveling salesman problemKARAPETYAN, D; GUTIN, G.European journal of operational research. 2011, Vol 208, Num 3, pp 221-232, issn 0377-2217, 12 p.Article

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

A comparative analysis of several asymmetric traveling salesman problem formulationsONCAN, Temel; ALTINEL, I. Kuban; LAPORTE, Gilbert et al.Computers & operations research. 2009, Vol 36, Num 3, pp 637-654, issn 0305-0548, 18 p.Article

A theoretical study on the behavior of simulated annealing leading to a new cooling schedule : Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applicationsTRIKI, E; COLLETTE, Y; SIARRY, P et al.European journal of operational research. 2005, Vol 166, Num 1, pp 77-92, issn 0377-2217, 16 p.Conference Paper