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 *

165 related articles for article (PubMed ID: 17775454)

  • 1. Exact solution of large asymmetric traveling salesman problems.
    Miller DL; Pekny JF
    Science; 1991 Feb; 251(4995):754-61. PubMed ID: 17775454
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Fast marching methods for the continuous traveling salesman problem.
    Andrews J; Sethian JA
    Proc Natl Acad Sci U S A; 2007 Jan; 104(4):1118-23. PubMed ID: 17220271
    [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. An analogue approach to the travelling salesman problem using an elastic net method.
    Durbin R; Willshaw D
    Nature; 1987 Apr 16-22; 326(6114):689-91. PubMed ID: 3561510
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 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. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining.
    Wu C; Liang Y; Lee HP; Lu C
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004; 70(1 Pt 2):016701. PubMed ID: 15324198
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Predatory search algorithm with restriction of solution distance.
    Liu C; Wang D
    Biol Cybern; 2005 May; 92(5):293-302. PubMed ID: 15838682
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Erratum.
    Science; 1991 Mar; 251(5001):1547. PubMed ID: 17793123
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Limitations of neural networks for solving traveling salesman problems.
    Gee AH; Prager RW
    IEEE Trans Neural Netw; 1995; 6(1):280-2. PubMed ID: 18263311
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. A neural-network-based approach to the double traveling salesman problem.
    Plebe A; Anile AM
    Neural Comput; 2002 Feb; 14(2):437-71. PubMed ID: 11802920
    [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. 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]  

  • 18. A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem.
    Dang C; Xu L
    Neural Comput; 2002 Feb; 14(2):303-24. PubMed ID: 11802914
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Solving a four-destination traveling salesman problem using Escherichia coli cells as biocomputers.
    Esau M; Rozema M; Zhang TH; Zeng D; Chiu S; Kwan R; Moorhouse C; Murray C; Tseng NT; Ridgway D; Sauvageau D; Ellison M
    ACS Synth Biol; 2014 Dec; 3(12):972-5. PubMed ID: 25524102
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.
    Mavrovouniotis M; Muller FM; Shengxiang Yang
    IEEE Trans Cybern; 2017 Jul; 47(7):1743-1756. PubMed ID: 27323387
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.