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 *

181 related articles for article (PubMed ID: 21728597)

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

  • 2. Circular Jaccard distance based multi-solution optimization for traveling salesman problems.
    Li H; Zhang M; Zeng C
    Math Biosci Eng; 2022 Mar; 19(5):4458-4480. PubMed ID: 35430823
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Colored Traveling Salesman Problem.
    Li J; Zhou M; Sun Q; Dai X; Yu X
    IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
    Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
    Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An optimal adaptive time-stepping scheme for solving reaction-diffusion-chemotaxis systems.
    Chiu C; Yu JL
    Math Biosci Eng; 2007 Apr; 4(2):187-203. PubMed ID: 17658923
    [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. 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]  

  • 11. Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm.
    Ban HB; Pham DH
    PeerJ Comput Sci; 2023; 9():e1192. PubMed ID: 37346673
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Deterministic walks with inverse-square power-law scaling are an emergent property of predators that use chemotaxis to locate randomly distributed prey.
    Reynolds AM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Jul; 78(1 Pt 1):011906. PubMed ID: 18763981
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 17. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
    Wang ZC; Liang K; Bao XG; Wu TH
    IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Two-dimensional phase unwrapping using a hybrid genetic algorithm.
    Karout SA; Gdeisat MA; Burton DR; Lalor MJ
    Appl Opt; 2007 Feb; 46(5):730-43. PubMed ID: 17279161
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.