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 *

121 related articles for article (PubMed ID: 37474594)

  • 1. Traveling salesman problem solution using magnonic combinatorial device.
    Balinskyy M; Khitun A
    Sci Rep; 2023 Jul; 13(1):11708. PubMed ID: 37474594
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Combinatorial logic devices based on a multi-path active ring circuit.
    Khitun A; Balinskiy M
    Sci Rep; 2022 Jun; 12(1):9482. PubMed ID: 35676415
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
    Bao X; Wang G; Xu L; Wang Z
    Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. On approximating a new generalization of traveling salesman problem.
    Huang Z; Liao X; Naik PA; Lu X
    Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The multi-stripe travelling salesman problem.
    Çela E; Deineko VG; Woeginger GJ
    Ann Oper Res; 2017; 259(1):21-34. PubMed ID: 29200584
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Parameter setting of the Hopfield network applied to TSP.
    Talaván PM; Yáñez J
    Neural Netw; 2002 Apr; 15(3):363-73. PubMed ID: 12125891
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Generating subtour elimination constraints for the TSP from pure integer solutions.
    Pferschy U; Staněk R
    Cent Eur J Oper Res; 2017; 25(1):231-260. PubMed ID: 28690424
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 17. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem.
    Jin HD; Leung KS; Wong ML; Xu ZB
    IEEE Trans Syst Man Cybern B Cybern; 2003; 33(6):877-88. PubMed ID: 18238240
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Contribution of the hippocampus to performance on the traveling salesperson problem in rats.
    Hales JB; Petty EA; Collins G; Blaser RE
    Behav Brain Res; 2021 May; 405():113177. PubMed ID: 33607167
    [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. 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]  

    [Next]    [New Search]
    of 7.