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 *

196 related articles for article (PubMed ID: 36092009)

  • 1. Some metaheuristic algorithms for solving multiple cross-functional team selection problems.
    Ngo ST; Jaafar J; Izzatdin AA; Tong GT; Bui AN
    PeerJ Comput Sci; 2022; 8():e1063. PubMed ID: 36092009
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem.
    Ngo TS; Jaafar J; Aziz IA; Aftab MU; Nguyen HG; Bui NA
    Entropy (Basel); 2022 Mar; 24(3):. PubMed ID: 35327899
    [TBL] [Abstract][Full Text] [Related]  

  • 3. MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and AntColony.
    Ke L; Zhang Q; Battiti R
    IEEE Trans Cybern; 2013 Dec; 43(6):1845-59. PubMed ID: 23757576
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
    Chen X; Kong Y; Dang L; Hou Y; Ye X
    PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.
    Rajeswari M; Amudhavel J; Pothula S; Dhavachelvan P
    Comput Intell Neurosci; 2017; 2017():6563498. PubMed ID: 28473849
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Load Balancing Based on Firefly and Ant Colony Optimization Algorithms for Parallel Computing.
    Li Y; Li J; Sun Y; Li H
    Biomimetics (Basel); 2022 Oct; 7(4):. PubMed ID: 36278725
    [TBL] [Abstract][Full Text] [Related]  

  • 7. AutoMH: Automatically Create Evolutionary Metaheuristic Algorithms Using Reinforcement Learning.
    Almonacid B
    Entropy (Basel); 2022 Jul; 24(7):. PubMed ID: 35885180
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A computational efficient optimization of flow shop scheduling problems.
    Liang Z; Zhong P; Liu M; Zhang C; Zhang Z
    Sci Rep; 2022 Jan; 12(1):845. PubMed ID: 35039598
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Research on improved ant colony optimization for traveling salesman problem.
    Fei T; Wu X; Zhang L; Zhang Y; Chen L
    Math Biosci Eng; 2022 Jun; 19(8):8152-8186. PubMed ID: 35801461
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Domain knowledge-assisted multi-objective evolutionary algorithm for channel selection in brain-computer interface systems.
    Liu T; Ye A
    Front Neurosci; 2023; 17():1251968. PubMed ID: 37746153
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Inventory replenishment decision model for the supplier selection problem using metaheuristic algorithms.
    Alejo-Reyes A; Olivares-Benitez E; Mendoza A; Rodriguez A
    Math Biosci Eng; 2019 Dec; 17(3):2016-2036. PubMed ID: 32233521
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Toward a Robust Multi-Objective Metaheuristic for Solving the Relay Node Placement Problem in Wireless Sensor Networks.
    Lanza-Gutiérrez JM; Caballé N; Gómez-Pulido JA; Crawford B; Soto R
    Sensors (Basel); 2019 Feb; 19(3):. PubMed ID: 30736434
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An adaptive ant colony system algorithm for continuous-space optimization problems.
    Li YJ; Wu TJ
    J Zhejiang Univ Sci; 2003; 4(1):40-6. PubMed ID: 12656341
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
    Mohsen AM
    Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. A hybrid ant colony algorithm for the winner determination problem.
    Wu J; Fan M; Liu Y; Zhou Y; Yang N; Yin M
    Math Biosci Eng; 2022 Jan; 19(3):3202-3222. PubMed ID: 35240827
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.
    Ali AF; Tawhid MA
    Springerplus; 2016; 5():473. PubMed ID: 27217988
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.