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.
108 related articles for article (PubMed ID: 26129639)
21. The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation. Lemmon AR; Milinkovitch MC Proc Natl Acad Sci U S A; 2002 Aug; 99(16):10516-21. PubMed ID: 12142465 [TBL] [Abstract][Full Text] [Related]
22. Hiding solutions in random satisfiability problems: a statistical mechanics approach. Barthel W; Hartmann AK; Leone M; Ricci-Tersenghi F; Weigt M; Zecchina R Phys Rev Lett; 2002 May; 88(18):188701. PubMed ID: 12005728 [TBL] [Abstract][Full Text] [Related]
23. Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms. Barthel W; Hartmann AK; Weigt M Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jun; 67(6 Pt 2):066104. PubMed ID: 16241301 [TBL] [Abstract][Full Text] [Related]
24. Hybridization of decomposition and local search for multiobjective optimization. Ke L; Zhang Q; Battiti R IEEE Trans Cybern; 2014 Oct; 44(10):1808-20. PubMed ID: 25222724 [TBL] [Abstract][Full Text] [Related]
25. Solving multiconstraint assignment problems using learning automata. Horn G; Oommen BJ IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):6-18. PubMed ID: 19884057 [TBL] [Abstract][Full Text] [Related]
26. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling. Yang S; Wang D IEEE Trans Neural Netw; 2000; 11(2):474-86. PubMed ID: 18249776 [TBL] [Abstract][Full Text] [Related]
27. 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]
28. 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]
29. Amoeba-based computing for traveling salesman problem: long-term correlations between spatially separated individual cells of Physarum polycephalum. Zhu L; Aono M; Kim SJ; Hara M Biosystems; 2013 Apr; 112(1):1-10. PubMed ID: 23438635 [TBL] [Abstract][Full Text] [Related]
30. 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]
31. Efficient heuristics for maximum common substructure search. Englert P; Kovács P J Chem Inf Model; 2015 May; 55(5):941-55. PubMed ID: 25865959 [TBL] [Abstract][Full Text] [Related]
32. 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]
33. Behavior of heuristics on large and hard satisfiability problems. Ardelius J; Aurell E Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Sep; 74(3 Pt 2):037702. PubMed ID: 17025790 [TBL] [Abstract][Full Text] [Related]
34. Communities of solutions in single solution clusters of a random K-satisfiability formula. Zhou H; Ma H Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066108. PubMed ID: 20365232 [TBL] [Abstract][Full Text] [Related]
35. 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]
36. HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem. Liu Y; Guo P; Zeng Y Comput Intell Neurosci; 2022; 2022():6400318. PubMed ID: 35096045 [TBL] [Abstract][Full Text] [Related]
37. Effect of asymmetric deformation dynamics in amoeboid organism on its search ability. Saito K; Suefuji N; Kasai S Bioinspir Biomim; 2021 Mar; 16(3):. PubMed ID: 33592599 [TBL] [Abstract][Full Text] [Related]
38. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem. Sun J; Zhang Q; Yao X IEEE Trans Cybern; 2014 Mar; 44(3):429-44. PubMed ID: 23757559 [TBL] [Abstract][Full Text] [Related]