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 *

137 related articles for article (PubMed ID: 18263311)

  • 21. Solving large scale traveling salesman problems by chaotic neurodynamics.
    Hasegawa M; Ikeguch T; Aihara K
    Neural Netw; 2002 Mar; 15(2):271-83. PubMed ID: 12022514
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Design of recurrent neural networks for solving constrained least absolute deviation problems.
    Hu X; Sun C; Zhang B
    IEEE Trans Neural Netw; 2010 Jul; 21(7):1073-86. PubMed ID: 20562048
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. Self-organization and solution of shortest-path optimization problems with memristive networks.
    Pershin YV; Di Ventra M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jul; 88(1):013305. PubMed ID: 23944581
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A novel recurrent neural network for solving nonlinear optimization problems with inequality constraints.
    Xia Y; Feng G; Wang J
    IEEE Trans Neural Netw; 2008 Aug; 19(8):1340-53. PubMed ID: 18701366
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems.
    Kiran MS; Beskirli M
    Biomimetics (Basel); 2024 Feb; 9(2):. PubMed ID: 38392165
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Chemotaxis can provide biological organisms with good solutions to the travelling salesman problem.
    Reynolds AM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 May; 83(5 Pt 1):052901. PubMed ID: 21728597
    [TBL] [Abstract][Full Text] [Related]  

  • 29. The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.
    Cochrane EM; Beasley JE
    Neural Netw; 2003 Dec; 16(10):1499-525. PubMed ID: 14622879
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Solution for a bipartite Euclidean traveling-salesman problem in one dimension.
    Caracciolo S; Di Gioacchino A; Gherardi M; Malatesta EM
    Phys Rev E; 2018 May; 97(5-1):052109. PubMed ID: 29906886
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A one-layer recurrent neural network for constrained nonsmooth optimization.
    Liu Q; Wang J
    IEEE Trans Syst Man Cybern B Cybern; 2011 Oct; 41(5):1323-33. PubMed ID: 21536534
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Group updates and multiscaling: an efficient neural network approach to combinatorial optimization.
    Likas A; Stafylopatis A
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(2):222-32. PubMed ID: 18263025
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.
    Zhang Z; Gao C; Lu Y; Liu Y; Liang M
    PLoS One; 2016; 11(1):e0146709. PubMed ID: 26751562
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 36. People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.
    Acuña DE; Parada V
    PLoS One; 2010 Jul; 5(7):e11685. PubMed ID: 20686597
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Solving traveling salesman problems with DNA molecules encoding numerical values.
    Lee JY; Shin SY; Park TH; Zhang BT
    Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. Hybrid pointer networks for traveling salesman problems optimization.
    Stohy A; Abdelhakam HT; Ali S; Elhenawy M; Hassan AA; Masoud M; Glaser S; Rakotonirainy A
    PLoS One; 2021; 16(12):e0260995. PubMed ID: 34905571
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.