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 *

210 related articles for article (PubMed ID: 30995233)

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

  • 2. Implementation of an effective hybrid GA for large-scale traveling salesman problems.
    Nguyen HD; Yoshihara I; Yamamori K; Yasunaga M
    IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):92-9. PubMed ID: 17278563
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An evolutionary algorithm for large traveling salesman problems.
    Tsai HK; Yang JM; Tsai YF; Kao CY
    IEEE Trans Syst Man Cybern B Cybern; 2004 Aug; 34(4):1718-29. PubMed ID: 15462439
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
    Liu G; Xu X; Wang F; Tang Y
    Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.
    Jiang ZB; Yang Q
    PLoS One; 2016; 11(11):e0165804. PubMed ID: 27812175
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima.
    Tinós R; Whitley D; Ochoa G
    Evol Comput; 2020; 28(2):255-288. PubMed ID: 30900928
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. The traveling salesman problem in surgery: economy of motion for the FLS Peg Transfer task.
    Falcone JL; Chen X; Hamad GG
    Surg Endosc; 2013 May; 27(5):1636-41. PubMed ID: 23233017
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink.
    Tang J; Yang W; Zhu L; Wang D; Feng X
    Sensors (Basel); 2017 Apr; 17(5):. PubMed ID: 28445434
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network.
    Du Y; Fu S; Lu C; Zhou Q; Li C
    Comput Intell Neurosci; 2021; 2021():5590758. PubMed ID: 34122533
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A three-phase algorithm for the pollution traveling Salesman problem.
    García-Vasquez K; Linfati R; Escobar JW
    Heliyon; 2024 May; 10(9):e29958. PubMed ID: 38694131
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 18. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
    Contreras-Bolton C; Parada V
    PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
    [TBL] [Abstract][Full Text] [Related]  

  • 19. The traveling salesman problem: a hierarchical model.
    Graham SM; Joshi A; Pizlo Z
    Mem Cognit; 2000 Oct; 28(7):1191-204. PubMed ID: 11126941
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 11.