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 *

240 related articles for article (PubMed ID: 27034650)

  • 1. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem.
    Zhan SH; Lin J; Zhang ZJ; Zhong YW
    Comput Intell Neurosci; 2016; 2016():1712630. PubMed ID: 27034650
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem.
    Hasegawa M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Mar; 83(3 Pt 2):036708. PubMed ID: 21517626
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem.
    Stodola P; Michenka K; Nohel J; Rybanský M
    Entropy (Basel); 2020 Aug; 22(8):. PubMed ID: 33286654
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
    Mohsen AM
    Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 9. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing.
    Budinich M
    Neural Comput; 1996 Feb; 8(2):416-24. PubMed ID: 8581888
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Solving the Traveling Salesman's Problem Using the African Buffalo Optimization.
    Odili JB; Mohmad Kahar MN
    Comput Intell Neurosci; 2016; 2016():1510256. PubMed ID: 26880872
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 14. Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP).
    Hao T; Yingnian W; Jiaxing Z; Jing Z
    PeerJ Comput Sci; 2023; 9():e1609. PubMed ID: 37810357
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.
    Wang L; Li S; Tian F; Fu X
    IEEE Trans Syst Man Cybern B Cybern; 2004 Oct; 34(5):2119-25. PubMed ID: 15503507
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Optimization by quantum annealing: lessons from hard satisfiability problems.
    Battaglia DA; Santoro GE; Tosatti E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066707. PubMed ID: 16089911
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.