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 *

205 related articles for article (PubMed ID: 25165742)

  • 1. Focusing on the golden ball metaheuristic: an extended study on a wider set of problems.
    Osaba E; Diaz F; Carballedo R; Onieva E; Perallos A
    ScientificWorldJournal; 2014; 2014():563259. PubMed ID: 25165742
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.
    Dalbah LM; Al-Betar MA; Awadallah MA; Zitar RA
    J King Saud Univ Comput Inf Sci; 2022 Sep; 34(8):4782-4795. PubMed ID: 37520767
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Application of the artificial bee colony algorithm for solving the set covering problem.
    Crawford B; Soto R; Cuesta R; Paredes F
    ScientificWorldJournal; 2014; 2014():189164. PubMed ID: 24883356
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Improved artificial bee colony algorithm for vehicle routing problem with time windows.
    Yao B; Yan Q; Zhang M; Yang Y
    PLoS One; 2017; 12(9):e0181275. PubMed ID: 28961252
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.
    Ezugwu AE; Akutsah F; Olusanya MO; Adewumi AO
    PLoS One; 2018; 13(3):e0193751. PubMed ID: 29554662
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm.
    Montiel-Arrieta LJ; Barragan-Vite I; Seck-Tuoh-Mora JC; Hernandez-Romero N; González-Hernández M; Medina-Marin J
    PeerJ Comput Sci; 2023; 9():e1728. PubMed ID: 38192486
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A solution quality assessment method for swarm intelligence optimization algorithms.
    Zhang Z; Wang GG; Zou K; Zhang J
    ScientificWorldJournal; 2014; 2014():183809. PubMed ID: 25013845
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
    Liu G; Xu X; Wang F; Tang Y
    Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A room-oriented artificial bee colony algorithm for optimizing the patient admission scheduling problem.
    Bolaji AL; Bamigbola AF; Adewole LB; Shola PB; Afolorunso A; Obayomi AA; Aremu DR; Almazroi AAA
    Comput Biol Med; 2022 Sep; 148():105850. PubMed ID: 35901536
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem.
    Feng L; Huang Y; Zhou L; Zhong J; Gupta A; Tang K; Tan KC
    IEEE Trans Cybern; 2021 Jun; 51(6):3143-3156. PubMed ID: 32149663
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
    Contreras-Bolton C; Parada V
    PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.
    Bacanin N; Tuba M
    ScientificWorldJournal; 2014; 2014():721521. PubMed ID: 24991645
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
    Carretero JA; Nahon MA
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 11.