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)

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

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

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

  • 24. Statistical mechanics of combinatorial optimization problems with site disorder.
    Dean DS; Lancaster D; Majumdar SN
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Aug; 72(2 Pt 2):026125. PubMed ID: 16196662
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. An optical solution for the traveling salesman problem.
    Haist T; Osten W
    Opt Express; 2007 Aug; 15(16):10473-82. PubMed ID: 19547400
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Checking for optimal solutions in some NP-complete problems.
    Bauer M; Orland H
    Phys Rev Lett; 2005 Sep; 95(10):107202. PubMed ID: 16196960
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Memory-efficient Transformer-based network model for Traveling Salesman Problem.
    Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M
    Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Stability of Solutions to Classes of Traveling Salesman Problems.
    Niendorf M; Kabamba PT; Girard AR
    IEEE Trans Cybern; 2016 Apr; 46(4):973-85. PubMed ID: 25910270
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.
    Takahashi Y
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):906-19. PubMed ID: 18256012
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. The elastic net algorithm and protein structure prediction.
    Ball KD; Erman B; Dill KA
    J Comput Chem; 2002 Jan; 23(1):77-83. PubMed ID: 11913391
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Solution for a bipartite Euclidean traveling-salesman problem in one dimension.
    Caracciolo S; Di Gioacchino A; Gherardi M; Malatesta EM
    Phys Rev E; 2018 May; 97(5-1):052109. PubMed ID: 29906886
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Branch-and-bound methods for euclidean registration problems.
    Olsson C; Kahl F; Oskarsson M
    IEEE Trans Pattern Anal Mach Intell; 2009 May; 31(5):783-94. PubMed ID: 19299855
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Multiagent optimization system for solving the traveling salesman problem (TSP).
    Xie XF; Liu J
    IEEE Trans Syst Man Cybern B Cybern; 2009 Apr; 39(2):489-502. PubMed ID: 19095545
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Scheduling multiprocessor job with resource and timing constraints using neural networks.
    Huang YM; Chen RM
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(4):490-502. PubMed ID: 18252324
    [TBL] [Abstract][Full Text] [Related]  

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

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