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 *

132 related articles for article (PubMed ID: 18282837)

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

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

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

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

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

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

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

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

  • 11. Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning.
    Zhang Z; Liu H; Zhou M; Wang J
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2119-2132. PubMed ID: 34520362
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A neural network model as a globally coupled map and applications based on chaos.
    Nozawa H
    Chaos; 1992 Jul; 2(3):377-386. PubMed ID: 12779987
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 18. Inhibitory grids and the assignment problem.
    Wolfe WJ; Macmillan JM; Brady G; Mathews R; Rothman JA; Mathis D; Orosz MD; Anderson C; Alaghband G
    IEEE Trans Neural Netw; 1993; 4(2):319-31. PubMed ID: 18267731
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 7.