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 *

102 related articles for article (PubMed ID: 18267780)

  • 1. Solving the quadratic assignment problem with clues from nature.
    Nissen V
    IEEE Trans Neural Netw; 1994; 5(1):66-72. PubMed ID: 18267780
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
    Liu J; Sun Y; Li G; Song B; Huang W
    Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
    Lim WL; Wibowo A; Desa MI; Haron H
    Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Combinatorial optimization with use of guided evolutionary simulated annealing.
    Yip PC; Pao YH
    IEEE Trans Neural Netw; 1995; 6(2):290-5. PubMed ID: 18263313
    [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. Evolving evolutionary algorithms using linear genetic programming.
    Oltean M
    Evol Comput; 2005; 13(3):387-410. PubMed ID: 16156929
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.
    Lee I; Sikora R; Shaw MJ
    IEEE Trans Syst Man Cybern B Cybern; 1997; 27(1):36-54. PubMed ID: 18255838
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Ant system: optimization by a colony of cooperating agents.
    Dorigo M; Maniezzo V; Colorni A
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):29-41. PubMed ID: 18263004
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.
    Deb K; Sinha A
    Evol Comput; 2010; 18(3):403-49. PubMed ID: 20560758
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem.
    Misevičius A; Verenė D
    Entropy (Basel); 2021 Jan; 23(1):. PubMed ID: 33466928
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An evolutionary tabu search for cell image segmentation.
    Jiang T; Yang F
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(5):675-8. PubMed ID: 18244872
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Local search with quadratic approximations into memetic algorithms for optimization with multiple criteria.
    Wanner EF; Guimarães FG; Takahashi RH; Fleming PJ
    Evol Comput; 2008; 16(2):185-224. PubMed ID: 18554100
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Memetic algorithms for the unconstrained binary quadratic programming problem.
    Merz P; Katayama K
    Biosystems; 2004 Dec; 78(1-3):99-118. PubMed ID: 15555762
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Nonconvex compressed sensing by nature-inspired optimization algorithms.
    Liu F; Lin L; Jiao L; Li L; Yang S; Hou B; Ma H; Yang L; Xu J
    IEEE Trans Cybern; 2015 May; 45(5):1028-39. PubMed ID: 25148677
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Graph drawing using tabu search coupled with path relinking.
    Dib FK; Rodgers P
    PLoS One; 2018; 13(5):e0197103. PubMed ID: 29746576
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Two hybrid compaction algorithms for the layout optimization problem.
    Xiao RB; Xu YC; Amos M
    Biosystems; 2007; 90(2):560-7. PubMed ID: 17331638
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Mixed integer evolution strategies for parameter optimization.
    Li R; Emmerich MT; Eggermont J; Bäck T; Schütz M; Dijkstra J; Reiber JH
    Evol Comput; 2013; 21(1):29-64. PubMed ID: 22122384
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
    Sabar NR; Ayob M; Kendall G; Qu R
    IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.