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 *

164 related articles for article (PubMed ID: 29200584)

  • 21. Remarkable problem-solving ability of unicellular amoeboid organism and its mechanism.
    Zhu L; Kim SJ; Hara M; Aono M
    R Soc Open Sci; 2018 Dec; 5(12):180396. PubMed ID: 30662714
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Ant colonies for the travelling salesman problem.
    Dorigo M; Gambardella LM
    Biosystems; 1997; 43(2):73-81. PubMed ID: 9231906
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Dataset for the electric capacitated traveling salesman problem.
    Gialos A; Zeimpekis V
    Data Brief; 2023 Oct; 50():109464. PubMed ID: 37593182
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Ant system: optimization by a colony of cooperating agents.
    Dorigo M; Maniezzo V; Colorni A
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):29-41. PubMed ID: 18263004
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 26. On approximating a new generalization of traveling salesman problem.
    Huang Z; Liao X; Naik PA; Lu X
    Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 30. Acknowledging crossing-avoidance heuristic violations when solving the Euclidean travelling salesperson problem.
    Kyritsis M; Gulliver SR; Feredoes E
    Psychol Res; 2018 Sep; 82(5):997-1009. PubMed ID: 28608230
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. A novel approach for solving travelling thief problem using enhanced simulated annealing.
    Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
    PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
    Dahan F; El Hindi K; Mathkour H; AlSalman H
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Feature-Based Diversity Optimization for Problem Instance Classification.
    Gao W; Nallaperuma S; Neumann F
    Evol Comput; 2021; 29(1):107-128. PubMed ID: 32551995
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem.
    Shi J; Sun J; Zhang Q; Ye K
    IEEE Trans Cybern; 2022 Jan; 52(1):495-507. PubMed ID: 32275640
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Critical transition in the constrained traveling salesman problem.
    Andrecut M; Ali MK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Apr; 63(4 Pt 2):047103. PubMed ID: 11308979
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Characterization of the probabilistic traveling salesman problem.
    Bowler NE; Fink TM; Ball RC
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036703. PubMed ID: 14524922
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

  • 40. An Analysis of the Fitness Landscape of Travelling Salesman Problem.
    Tayarani-N MH; Prügel-Bennett A
    Evol Comput; 2016; 24(2):347-84. PubMed ID: 26066806
    [TBL] [Abstract][Full Text] [Related]  

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