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 *

125 related articles for article (PubMed ID: 30133477)

  • 1. Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.
    Anaya Fuentes GE; Hernández Gress ES; Seck Tuoh Mora JC; Medina Marín J
    PLoS One; 2018; 13(8):e0201868. PubMed ID: 30133477
    [TBL] [Abstract][Full Text] [Related]  

  • 2. The ordered clustered travelling salesman problem: a hybrid genetic algorithm.
    Ahmed ZH
    ScientificWorldJournal; 2014; 2014():258207. PubMed ID: 24701148
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Precedence-Constrained Colored Traveling Salesman Problem: An Augmented Variable Neighborhood Search Approach.
    Xu X; Li J; Zhou M; Yu X
    IEEE Trans Cybern; 2022 Sep; 52(9):9797-9808. PubMed ID: 34033558
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.
    Le HT; Geser P; Middendorf M
    Evol Comput; 2021 Sep; 29(3):415-439. PubMed ID: 34467994
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem.
    Odili JB; Noraziah A; Zarina M
    Comput Intell Neurosci; 2021; 2021():6625438. PubMed ID: 33986793
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem.
    Kyritsis M; Blathras G; Gulliver S; Varela VA
    Heliyon; 2017 Nov; 3(11):e00461. PubMed ID: 29264418
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. An Analysis of the Fitness Landscape of Travelling Salesman Problem.
    Tayarani-N MH; Prügel-Bennett A
    Evol Comput; 2016; 24(2):347-84. PubMed ID: 26066806
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. A clustering metaheuristic for large orienteering problems.
    Elzein A; Di Caro GA
    PLoS One; 2022; 17(7):e0271751. PubMed ID: 35867693
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
    Pourhassan M; Neumann F
    Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Cumulative Capacitated Colored Traveling Salesman Problem.
    Xu X; Cao J; Shi X; Gorbachev S
    IEEE Trans Cybern; 2024 Aug; 54(8):4553-4566. PubMed ID: 38117629
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
    Lissovoi A; Oliveto PS; Warwicker JA
    Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Time-constrained maximal covering routing problem.
    Amiri A; Salari M
    OR Spectr; 2019; 41(2):415-468. PubMed ID: 32214572
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.