173 related articles for article (PubMed ID: 23163779)
1. On handling ephemeral resource constraints in evolutionary search.
Allmendinger R; Knowles J
Evol Comput; 2013; 21(3):497-531. PubMed ID: 23163779
[TBL] [Abstract][Full Text] [Related]
2. Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces.
Malan KM; Moser I
Evol Comput; 2019; 27(2):267-289. PubMed ID: 29528726
[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. The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.
Hu J; Goodman E; Seo K; Fan Z; Rosenberg R
Evol Comput; 2005; 13(2):241-77. PubMed ID: 15969902
[TBL] [Abstract][Full Text] [Related]
5. Comparison of Constraint-Handling Mechanisms for the (1,λ)-ES on a Simple Constrained Problem.
Hellwig M; Arnold DV
Evol Comput; 2016; 24(1):1-23. PubMed ID: 25322066
[TBL] [Abstract][Full Text] [Related]
6. libSRES: a C library for stochastic ranking evolution strategy for parameter estimation.
Ji X; Xu Y
Bioinformatics; 2006 Jan; 22(1):124-6. PubMed ID: 16267082
[TBL] [Abstract][Full Text] [Related]
7. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.
Merz P; Freisleben B
Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231
[TBL] [Abstract][Full Text] [Related]
8. Evolutionary algorithms for the selection of single nucleotide polymorphisms.
Hubley RM; Zitzler E; Roach JC
BMC Bioinformatics; 2003 Jul; 4():30. PubMed ID: 12875658
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Agent-based model of genotype editing.
Huang CF; Kaur J; Maguitman A; Rocha LM
Evol Comput; 2007; 15(3):253-89. PubMed ID: 17705779
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. A study of redundancy and neutrality in evolutionary optimization.
Correia MB
Evol Comput; 2013; 21(3):413-43. PubMed ID: 22998618
[TBL] [Abstract][Full Text] [Related]
13. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
Friedrich T; Neumann F
Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
[TBL] [Abstract][Full Text] [Related]
14. Integrating iterative crossover capability in orthogonal neighborhoods for scheduling resource-constrained projects.
Zamani R
Evol Comput; 2013; 21(2):341-60. PubMed ID: 22709134
[TBL] [Abstract][Full Text] [Related]
15. GASAT: a genetic local search algorithm for the satisfiability problem.
Lardeux F; Saubion F; Hao JK
Evol Comput; 2006; 14(2):223-53. PubMed ID: 16831107
[TBL] [Abstract][Full Text] [Related]
16. Resampling versus repair in evolution strategies applied to a constrained linear problem.
Arnold DV
Evol Comput; 2013; 21(3):389-411. PubMed ID: 22780871
[TBL] [Abstract][Full Text] [Related]
17. Evolution by adapting surrogates.
Le MN; Ong YS; Menzel S; Jin Y; Sendhoff B
Evol Comput; 2013; 21(2):313-40. PubMed ID: 22564044
[TBL] [Abstract][Full Text] [Related]
18. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
Menczer F; Degeratu M; Street WN
Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
[TBL] [Abstract][Full Text] [Related]
19. Computational Complexity as an Ultimate Constraint on Evolution.
Kaznatcheev A
Genetics; 2019 May; 212(1):245-265. PubMed ID: 30833289
[TBL] [Abstract][Full Text] [Related]
20. Genetic diversity as an objective in multi-objective evolutionary algorithms.
Toffolo A; Benini E
Evol Comput; 2003; 11(2):151-67. PubMed ID: 12875667
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
