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 *

108 related articles for article (PubMed ID: 22385108)

  • 1. On local search for bi-objective knapsack problems.
    Liefooghe A; Paquete L; Figueira JR
    Evol Comput; 2013; 21(1):179-96. PubMed ID: 22385108
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
    Karapetyan D; Gutin G
    Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Multimodal optimization using a bi-objective evolutionary algorithm.
    Deb K; Saha A
    Evol Comput; 2012; 20(1):27-62. PubMed ID: 21591888
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An adaptive evolutionary multi-objective approach based on simulated annealing.
    Li H; Landa-Silva D
    Evol Comput; 2011; 19(4):561-95. PubMed ID: 21417745
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.
    Raidl GR; Gottlieb J
    Evol Comput; 2005; 13(4):441-75. PubMed ID: 16297279
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 7. On complexity of optimal recombination for binary representations of solutions.
    Eremeev AV
    Evol Comput; 2008; 16(1):127-47. PubMed ID: 18386998
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Memetic algorithms for continuous optimisation based on local search chains.
    Molina D; Lozano M; García-Martínez C; Herrera F
    Evol Comput; 2010; 18(1):27-63. PubMed ID: 20064025
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Approximating covering problems by randomized search heuristics using multi-objective models.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2010; 18(4):617-33. PubMed ID: 20583912
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems.
    Feng Y; Wang GG; Feng Q; Zhao XJ
    Comput Intell Neurosci; 2014; 2014():857254. PubMed ID: 25404940
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization.
    Elhossini A; Areibi S; Dony R
    Evol Comput; 2010; 18(1):127-56. PubMed ID: 20064026
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Binary salp swarm algorithm for discounted {0-1} knapsack problem.
    Dang BT; Truong TK
    PLoS One; 2022; 17(4):e0266537. PubMed ID: 35390109
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Automated discovery of local search heuristics for satisfiability testing.
    Fukunaga AS
    Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search.
    Huang X; Zeng X; Han R
    Comput Intell Neurosci; 2017; 2017():3235720. PubMed ID: 28634487
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A new evolutionary algorithm for solving many-objective optimization problems.
    Zou X; Chen Y; Liu M; Kang L
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1402-12. PubMed ID: 18784020
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Evolutionary and principled search strategies for sensornet protocol optimization.
    Tate J; Woolford-Lim B; Bate I; Yao X
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):163-80. PubMed ID: 21859628
    [TBL] [Abstract][Full Text] [Related]  

  • 17. HypE: an algorithm for fast hypervolume-based many-objective optimization.
    Bader J; Zitzler E
    Evol Comput; 2011; 19(1):45-76. PubMed ID: 20649424
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Analysis of (1+1) evolutionary algorithm and randomized local search with memory.
    Sung CW; Yuen SY
    Evol Comput; 2011; 19(2):287-323. PubMed ID: 20868262
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A memetic genetic algorithm for the vertex p-center problem.
    Pullan W
    Evol Comput; 2008; 16(3):417-36. PubMed ID: 18811248
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.