kw.\*:("travelling salesman problem")
Results 1 to 25 of 1842
Selection :
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
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
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
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
Improvements to the Or-opt heuristic for the symmetric travelling salesman problemBABIN, G; DENEAULT, S; LAPORTE, G et al.The Journal of the Operational Research Society. 2007, Vol 58, Num 3, pp 402-407, issn 0160-5682, 6 p.Article
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
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
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
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
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
Sur une modification du problème du commis voyageurGERASIMOV, V. A.Avtomatika i telemehanika. 1983, Num 9, pp 161-164, issn 0005-2310Article
Nonoptimal edges for the symmetric traveling salesman problemJONKER, R; VOLGENANT, T.Operations research. 1984, Vol 32, Num 4, pp 837-846, issn 0030-364XArticle
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
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