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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

103 related articles for article (PubMed ID: 18263553)

  • 1. 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]  

  • 2. Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers.
    Li SZ
    IEEE Trans Neural Netw; 1996; 7(6):1507-16. PubMed ID: 18263545
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.
    Takahashi Y
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):906-19. PubMed ID: 18256012
    [TBL] [Abstract][Full Text] [Related]  

  • 4. The multi-stripe travelling salesman problem.
    Çela E; Deineko VG; Woeginger GJ
    Ann Oper Res; 2017; 259(1):21-34. PubMed ID: 29200584
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 6. Solving the TSP by the AALHNN algorithm.
    Hu Y; Duan Q
    Math Biosci Eng; 2022 Jan; 19(4):3427-3448. PubMed ID: 35341258
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Solving linear integer programming problems by a novel neural model.
    Cavalieri S
    Int J Neural Syst; 1999 Feb; 9(1):27-39. PubMed ID: 10401928
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Stability analysis of higher-order neural networks for combinatorial optimization.
    Cooper B
    Int J Neural Syst; 2002; 12(3-4):177-86. PubMed ID: 12370960
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank.
    Wilson GV; Pawley GS
    Biol Cybern; 1988; 58(1):63-70. PubMed ID: 3345321
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem.
    Aras N; Oommen BJ; Altinel IK
    Neural Netw; 1999 Nov; 12(9):1273-1284. PubMed ID: 12662632
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. 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]  

  • 15. 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]  

  • 16. Scheduling multiprocessor job with resource and timing constraints using neural networks.
    Huang YM; Chen RM
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(4):490-502. PubMed ID: 18252324
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An Investigation into the Improvement of Local Minima of the Hopfield Network.
    Armitage AF; Gupta NK; Peng M
    Neural Netw; 1996 Oct; 9(7):1241-1253. PubMed ID: 12662596
    [TBL] [Abstract][Full Text] [Related]  

  • 18. 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]  

  • 19. A Generalized Hopfield Network for Nonsmooth Constrained Convex Optimization: Lie Derivative Approach.
    Li C; Yu X; Huang T; Chen G; He X
    IEEE Trans Neural Netw Learn Syst; 2016 Feb; 27(2):308-21. PubMed ID: 26595931
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Implementation of the three-dimensional-pattern search problem on Hopfield-like neural networks.
    Feuilleaubois E; Fabart V; Doucet JP
    SAR QSAR Environ Res; 1993; 1(2-3):97-114. PubMed ID: 8790627
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.