201 related articles for article (PubMed ID: 18263545)
21. Convergence properties of a modified Hopfield-Tank model.
Bizzarri AR
Biol Cybern; 1991; 64(4):293-300. PubMed ID: 2025662
[TBL] [Abstract][Full Text] [Related]
22. A high-performance feedback neural network for solving convex nonlinear programming problems.
Leung Y; Chen KZ; Gao XB
IEEE Trans Neural Netw; 2003; 14(6):1469-77. PubMed ID: 18244592
[TBL] [Abstract][Full Text] [Related]
23. Design and analysis of maximum Hopfield networks.
Galán-Marín G; Muñoz-Pérez J
IEEE Trans Neural Netw; 2001; 12(2):329-39. PubMed ID: 18244387
[TBL] [Abstract][Full Text] [Related]
24. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
Mulder SA; Wunsch DC
Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. "Optimal" Hopfield network for combinatorial optimization with linear cost function.
Matsuda S
IEEE Trans Neural Netw; 1998; 9(6):1319-30. PubMed ID: 18255812
[TBL] [Abstract][Full Text] [Related]
27. 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]
28. 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]
29. A new neural network for solving nonlinear projection equations.
Xia Y; Feng G
Neural Netw; 2007 Jul; 20(5):577-89. PubMed ID: 17452092
[TBL] [Abstract][Full Text] [Related]
30. A theoretical investigation into the performance of the Hopfield model.
Aiyer SB; Niranjan M; Fallside F
IEEE Trans Neural Netw; 1990; 1(2):204-15. PubMed ID: 18282837
[TBL] [Abstract][Full Text] [Related]
31. A neural network approach to job-shop scheduling.
Zhou DN; Cherkassky V; Baldwin TR; Olson DE
IEEE Trans Neural Netw; 1991; 2(1):175-9. PubMed ID: 18276371
[TBL] [Abstract][Full Text] [Related]
32. Synthesis of fault-tolerant feedforward neural networks using minimax optimization.
Deodhare D; Vidyasagar M; Sathiya Keethi S
IEEE Trans Neural Netw; 1998; 9(5):891-900. PubMed ID: 18255774
[TBL] [Abstract][Full Text] [Related]
33. A novel approach for solving constrained nonlinear optimization problems using neurofuzzy systems.
da Silva IN; de Souza AN; Bordon ME
Int J Neural Syst; 2001 Jun; 11(3):281-6. PubMed ID: 11577380
[TBL] [Abstract][Full Text] [Related]
34. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
Dang C; Liang J; Yang Y
Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
[TBL] [Abstract][Full Text] [Related]
35. Combinatorial optimization by weight annealing in memristive hopfield networks.
Fahimi Z; Mahmoodi MR; Nili H; Polishchuk V; Strukov DB
Sci Rep; 2021 Aug; 11(1):16383. PubMed ID: 34385475
[TBL] [Abstract][Full Text] [Related]
36. Combining Hopfield neural networks, with applications to grid-based mathematics puzzles.
Fitzsimmons M; Kunze H
Neural Netw; 2019 Oct; 118():81-89. PubMed ID: 31254770
[TBL] [Abstract][Full Text] [Related]
37. Convergence acceleration of the Hopfield neural network by optimizing integration step sizes.
Abe S
IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):194-201. PubMed ID: 18263022
[TBL] [Abstract][Full Text] [Related]
38. Solving time delay fractional optimal control problems via a Gudermannian neural network and convergence results.
Kheyrinataj F; Nazemi A; Mortezaee M
Network; 2023; 34(1-2):122-150. PubMed ID: 36825846
[TBL] [Abstract][Full Text] [Related]
39. A discrete-time Lagrangian network for solving constrained quadratic programs.
Tang WS; Wang J
Int J Neural Syst; 2000 Aug; 10(4):261-5. PubMed ID: 11052413
[TBL] [Abstract][Full Text] [Related]
40. An accelerated end-to-end method for solving routing problems.
Zhu T; Shi X; Xu X; Cao J
Neural Netw; 2023 Jul; 164():535-545. PubMed ID: 37216756
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
