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 *

137 related articles for article (PubMed ID: 25910270)

  • 21. WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours With Dubins Vehicle.
    Drchal J; Faigl J; Vana P
    IEEE Trans Cybern; 2022 Feb; 52(2):1302-1311. PubMed ID: 32603305
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning.
    Zhang Z; Liu H; Zhou M; Wang J
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2119-2132. PubMed ID: 34520362
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem.
    Qian W; Basili RAM; Eshaghian-Wilner MM; Khokhar A; Luecke G; Vary JP
    Entropy (Basel); 2023 Aug; 25(8):. PubMed ID: 37628268
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Critical transition in the constrained traveling salesman problem.
    Andrecut M; Ali MK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Apr; 63(4 Pt 2):047103. PubMed ID: 11308979
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Stability analysis of higher-order neural networks for combinatorial optimization.
    Cooper B
    Int J Neural Syst; 2002; 12(3-4):177-86. PubMed ID: 12370960
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 32. Discrete Salp Swarm Algorithm for symmetric traveling salesman problem.
    Chen P; Liu M; Zhou S
    Math Biosci Eng; 2023 Mar; 20(5):8856-8874. PubMed ID: 37161225
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
    Dahan F; El Hindi K; Mathkour H; AlSalman H
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 37. A theoretical investigation into the performance of the Hopfield model.
    Aiyer SB; Niranjan M; Fallside F
    IEEE Trans Neural Netw; 1990; 1(2):204-15. PubMed ID: 18282837
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 40. Planning Your Route: Where to Start?
    Sengupta L; Mariescu-Istodor R; Fränti P
    Comput Brain Behav; 2018; 1(3):252-265. PubMed ID: 30596200
    [TBL] [Abstract][Full Text] [Related]  

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