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 *

175 related articles for article (PubMed ID: 35341258)

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

  • 2. A novel fractional-order memristive Hopfield neural network for traveling salesman problem and its FPGA implementation.
    Li X; Yang X; Ju X
    Neural Netw; 2024 Nov; 179():106548. PubMed ID: 39128274
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 6. Research on improved ant colony optimization for traveling salesman problem.
    Fei T; Wu X; Zhang L; Zhang Y; Chen L
    Math Biosci Eng; 2022 Jun; 19(8):8152-8186. PubMed ID: 35801461
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 10. A deterministic annealing algorithm for the minimum concave cost network flow problem.
    Dang C; Sun Y; Wang Y; Yang Y
    Neural Netw; 2011 Sep; 24(7):699-708. PubMed ID: 21482456
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A mathematical framework for improved weight initialization of neural networks using Lagrange multipliers.
    de Pater I; Mitici M
    Neural Netw; 2023 Sep; 166():579-594. PubMed ID: 37586258
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 16QAM blind equalization via maximum entropy density approximation technique and nonlinear Lagrange multipliers.
    Mauda R; Pinchas M
    ScientificWorldJournal; 2014; 2014():548714. PubMed ID: 24723813
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. Fast-convergent double-sigmoid Hopfield neural network as applied to optimization problems.
    Uykan Z
    IEEE Trans Neural Netw Learn Syst; 2013 Jun; 24(6):990-6. PubMed ID: 24808479
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
    Miao K; Duan H; Qian F; Dong Y
    PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.
    Wang Z; Wu X; Wu T
    Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Chaotic simulated annealing with decaying chaotic noise.
    He Y
    IEEE Trans Neural Netw; 2002; 13(6):1526-31. PubMed ID: 18244547
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 9.