90 related articles for article (PubMed ID: 31167320)
1. 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]
2. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
Al-Mulhem M; Al-Maghrabi T
IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. 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]
6. Analysis of the elastic net model applied to the formation of ocular dominance and orientation columns.
Goodhill GJ; Cimponeriu A
Network; 2000 May; 11(2):153-68. PubMed ID: 10880004
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
Dahan F; El Hindi K; Mathkour H; AlSalman H
Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
[TBL] [Abstract][Full Text] [Related]
9. A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem.
Dang C; Xu L
Neural Netw; 2001 Mar; 14(2):217-30. PubMed ID: 11316235
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
Bao X; Wang G; Xu L; Wang Z
Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
[TBL] [Abstract][Full Text] [Related]
12. The elastic net algorithm and protein structure prediction.
Ball KD; Erman B; Dill KA
J Comput Chem; 2002 Jan; 23(1):77-83. PubMed ID: 11913391
[TBL] [Abstract][Full Text] [Related]
13. A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem.
Dang C; Xu L
Neural Comput; 2002 Feb; 14(2):303-24. PubMed ID: 11802914
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Optimal HP configurations of proteins by combining local search with elastic net algorithm.
Guo YZ; Feng EM; Wang Y
J Biochem Biophys Methods; 2007 Apr; 70(3):335-40. PubMed ID: 16982100
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
