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 *

135 related articles for article (PubMed ID: 25910270)

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

  • 2. Exact and Approximate Stability of Solutions to Traveling Salesman Problems.
    Niendorf M; Girard AR
    IEEE Trans Cybern; 2018 Feb; 48(2):583-595. PubMed ID: 28103566
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour.
    Strutz T
    Front Robot AI; 2021; 8():652417. PubMed ID: 33912597
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost.
    Bae J; Chung W
    Sensors (Basel); 2019 May; 19(11):. PubMed ID: 31146430
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem.
    Nayak A; Rathinam S
    Sensors (Basel); 2023 Jul; 23(14):. PubMed ID: 37514725
    [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. 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]  

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

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

  • 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. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.
    Ahmed ZH
    ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148
    [TBL] [Abstract][Full Text] [Related]  

  • 14. People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.
    Acuña DE; Parada V
    PLoS One; 2010 Jul; 5(7):e11685. PubMed ID: 20686597
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem.
    Shi J; Sun J; Zhang Q; Ye K
    IEEE Trans Cybern; 2022 Jan; 52(1):495-507. PubMed ID: 32275640
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 7.