115 related articles for article (PubMed ID: 8581888)
1. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing.
Budinich M
Neural Comput; 1996 Feb; 8(2):416-24. PubMed ID: 8581888
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. Colored Traveling Salesman Problem.
Li J; Zhou M; Sun Q; Dai X; Yu X
IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
[TBL] [Abstract][Full Text] [Related]
4. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem.
Zhan SH; Lin J; Zhang ZJ; Zhong YW
Comput Intell Neurosci; 2016; 2016():1712630. PubMed ID: 27034650
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem.
Fort JC
Biol Cybern; 1988; 59(1):33-40. PubMed ID: 3401516
[TBL] [Abstract][Full Text] [Related]
7. Constrained Nets for Graph Matching and Other Quadratic Assignment Problems.
Simić PD
Neural Comput; 1991; 3(2):268-281. PubMed ID: 31167309
[TBL] [Abstract][Full Text] [Related]
8. A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.
Wang L; Li S; Tian F; Fu X
IEEE Trans Syst Man Cybern B Cybern; 2004 Oct; 34(5):2119-25. PubMed ID: 15503507
[TBL] [Abstract][Full Text] [Related]
9. A neural-network-based approach to the double traveling salesman problem.
Plebe A; Anile AM
Neural Comput; 2002 Feb; 14(2):437-71. PubMed ID: 11802920
[TBL] [Abstract][Full Text] [Related]
10. A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.
Aras N; Altinel IK; Oommen J
IEEE Trans Neural Netw; 2003; 14(4):869-90. PubMed ID: 18238067
[TBL] [Abstract][Full Text] [Related]
11. A semi-localized elastic net for surface reconstruction of objects from multislice images.
Damper RI; Gilson SJ; Middleton I
Int J Neural Syst; 2002 Apr; 12(2):95-108. PubMed ID: 12035124
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem.
Simmen MW
Neural Comput; 1991; 3(3):363-374. PubMed ID: 31167320
[TBL] [Abstract][Full Text] [Related]
14. The simultaneous recurrent neural network for addressing the scaling problem in static optimization.
Serpen G; Patwardhan A; Geib J
Int J Neural Syst; 2001 Oct; 11(5):477-87. PubMed ID: 11709814
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Characterization of the probabilistic traveling salesman problem.
Bowler NE; Fink TM; Ball RC
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036703. PubMed ID: 14524922
[TBL] [Abstract][Full Text] [Related]
17. Solving large scale traveling salesman problems by chaotic neurodynamics.
Hasegawa M; Ikeguch T; Aihara K
Neural Netw; 2002 Mar; 15(2):271-83. PubMed ID: 12022514
[TBL] [Abstract][Full Text] [Related]
18. An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.
Faigl J
Comput Intell Neurosci; 2016; 2016():2720630. PubMed ID: 27340395
[TBL] [Abstract][Full Text] [Related]
19. Minimum energy configurations of the 2-dimensional HP-model of proteins by self-organizing networks.
Yanikoglu B; Erman B
J Comput Biol; 2002; 9(4):613-20. PubMed ID: 12323096
[TBL] [Abstract][Full Text] [Related]
20. Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem.
Stodola P; Michenka K; Nohel J; Rybanský M
Entropy (Basel); 2020 Aug; 22(8):. PubMed ID: 33286654
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
