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 *

214 related articles for article (PubMed ID: 25700147)

  • 1. A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
    Corus D; Lehre PK; Neumann F; Pourhassan M
    Evol Comput; 2016; 24(1):183-203. PubMed ID: 25700147
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Feature-Based Diversity Optimization for Problem Instance Classification.
    Gao W; Nallaperuma S; Neumann F
    Evol Comput; 2021; 29(1):107-128. PubMed ID: 32551995
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems.
    Aishwaryaprajna ; Rowe JE
    Evol Comput; 2023 Sep; 31(3):259-285. PubMed ID: 36854020
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Evolving combinatorial problem instances that are difficult to solve.
    van Hemert JI
    Evol Comput; 2006; 14(4):433-62. PubMed ID: 17109606
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks.
    Camacho-Vallejo JF; Mar-Ortiz J; López-Ramos F; Rodríguez RP
    PLoS One; 2015; 10(6):e0128067. PubMed ID: 26102502
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the effect of populations in evolutionary multi-objective optimisation.
    Giel O; Lehre PK
    Evol Comput; 2010; 18(3):335-56. PubMed ID: 20560762
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Automated Algorithm Selection: Survey and Perspectives.
    Kerschke P; Hoos HH; Neumann F; Trautmann H
    Evol Comput; 2019; 27(1):3-45. PubMed ID: 30475672
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
    Ceberio J; Calvo B; Mendiburu A; Lozano JA
    Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.
    Horoba C
    Evol Comput; 2010; 18(3):357-81. PubMed ID: 20560760
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.
    Bossek J; Grimme C
    Evol Comput; 2024 Jun; 32(2):143-175. PubMed ID: 37290030
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Analysis of Randomised Search Heuristics for Dynamic Optimisation.
    Jansen T; Zarges C
    Evol Comput; 2015; 23(4):513-41. PubMed ID: 26241197
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Quantifying hybridization in realistic time.
    Collins J; Linz S; Semple C
    J Comput Biol; 2011 Oct; 18(10):1305-18. PubMed ID: 21210735
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Landscape Analysis of a Class of NP-Hard Binary Packing Problems.
    Alyahya K; Rowe JE
    Evol Comput; 2019; 27(1):47-73. PubMed ID: 30365387
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms.
    Hassan BA; Rashid TA
    Data Brief; 2020 Feb; 28():105046. PubMed ID: 31921951
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.