These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
2. An analogue approach to the travelling salesman problem using an elastic net method. Durbin R; Willshaw D Nature; 1987 Apr 16-22; 326(6114):689-91. PubMed ID: 3561510 [TBL] [Abstract][Full Text] [Related]
3. [Formula: see text]-Approximation for Graphic TSP. Mucha M Theory Comput Syst; 2014; 55(4):640-657. PubMed ID: 26300685 [TBL] [Abstract][Full Text] [Related]
4. Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour. Strutz T Front Robot AI; 2021; 8():652417. PubMed ID: 33912597 [TBL] [Abstract][Full Text] [Related]
5. An efficient approach to the travelling salesman problem using self-organizing maps. Vieira FC; Dória Neto AD; Costa JA Int J Neural Syst; 2003 Apr; 13(2):59-66. PubMed ID: 12923918 [TBL] [Abstract][Full Text] [Related]
6. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model. Wang Z; Wu X; Wu T Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485 [TBL] [Abstract][Full Text] [Related]
7. Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic. Anaya Fuentes GE; Hernández Gress ES; Seck Tuoh Mora JC; Medina Marín J PLoS One; 2018; 13(8):e0201868. PubMed ID: 30133477 [TBL] [Abstract][Full Text] [Related]
9. Stability of Solutions to Classes of Traveling Salesman Problems. Niendorf M; Kabamba PT; Girard AR IEEE Trans Cybern; 2016 Apr; 46(4):973-85. PubMed ID: 25910270 [TBL] [Abstract][Full Text] [Related]
10. Traveling salesman problem solution using magnonic combinatorial device. Balinskyy M; Khitun A Sci Rep; 2023 Jul; 13(1):11708. PubMed ID: 37474594 [TBL] [Abstract][Full Text] [Related]
11. Solving the clustered traveling salesman problem Lu Y; Hao JK; Wu Q PeerJ Comput Sci; 2022; 8():e972. PubMed ID: 35721414 [TBL] [Abstract][Full Text] [Related]
12. Memory-efficient Transformer-based network model for Traveling Salesman Problem. Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144 [TBL] [Abstract][Full Text] [Related]
13. Planning Your Route: Where to Start? Sengupta L; Mariescu-Istodor R; Fränti P Comput Brain Behav; 2018; 1(3):252-265. PubMed ID: 30596200 [TBL] [Abstract][Full Text] [Related]
14. Generating subtour elimination constraints for the TSP from pure integer solutions. Pferschy U; Staněk R Cent Eur J Oper Res; 2017; 25(1):231-260. PubMed ID: 28690424 [TBL] [Abstract][Full Text] [Related]
15. An argument for abandoning the travelling salesman problem as a neural-network benchmark. Smith K IEEE Trans Neural Netw; 1996; 7(6):1542-4. PubMed ID: 18263553 [TBL] [Abstract][Full Text] [Related]
16. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem. Jin HD; Leung KS; Wong ML; Xu ZB IEEE Trans Syst Man Cybern B Cybern; 2003; 33(6):877-88. PubMed ID: 18238240 [TBL] [Abstract][Full Text] [Related]
17. The ordered clustered travelling salesman problem: a hybrid genetic algorithm. Ahmed ZH ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148 [TBL] [Abstract][Full Text] [Related]
18. Parameter setting of the Hopfield network applied to TSP. Talaván PM; Yáñez J Neural Netw; 2002 Apr; 15(3):363-73. PubMed ID: 12125891 [TBL] [Abstract][Full Text] [Related]
19. A novel constructive-optimizer neural network for the traveling salesman problem. Saadatmand-Tarzjan M; Khademi M; Akbarzadeh-T MR; Moghaddam HA IEEE Trans Syst Man Cybern B Cybern; 2007 Aug; 37(4):754-70. PubMed ID: 17702277 [TBL] [Abstract][Full Text] [Related]
20. The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Cochrane EM; Beasley JE Neural Netw; 2003 Dec; 16(10):1499-525. PubMed ID: 14622879 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]