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.
62. 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]
63. An evolutionary algorithm based on approximation method and related techniques for solving bilevel programming problems. Liu Y; Li H; Chen H; Ma M PLoS One; 2022; 17(8):e0273564. PubMed ID: 36040918 [TBL] [Abstract][Full Text] [Related]
64. A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem. Li Z; Tang L; Liu J IEEE Trans Cybern; 2022 Apr; 52(4):2284-2299. PubMed ID: 32673199 [TBL] [Abstract][Full Text] [Related]
65. Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems. Blot A; Kessaci MÉ; Jourdan L; Hoos HH Evol Comput; 2019; 27(1):147-171. PubMed ID: 30407875 [TBL] [Abstract][Full Text] [Related]
66. An evaluation of methods for estimating the number of local optima in combinatorial optimization problems. Hernando L; Mendiburu A; Lozano JA Evol Comput; 2013; 21(4):625-58. PubMed ID: 23270389 [TBL] [Abstract][Full Text] [Related]
67. 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]
68. 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]
69. 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]
70. Synthesizing large-scale species trees using the strict consensus approach. Moon J; Eulenstein O J Bioinform Comput Biol; 2017 Jun; 15(3):1740002. PubMed ID: 28513253 [TBL] [Abstract][Full Text] [Related]
72. 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]
73. On the taxonomy of optimization problems under estimation of distribution algorithms. Echegoyen C; Mendiburu A; Santana R; Lozano JA Evol Comput; 2013; 21(3):471-95. PubMed ID: 23136917 [TBL] [Abstract][Full Text] [Related]
74. A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem. Viana MS; Contreras RC; Morandin Junior O Sensors (Basel); 2022 Jun; 22(12):. PubMed ID: 35746343 [TBL] [Abstract][Full Text] [Related]
75. Constraint Logic Programming approach to protein structure prediction. Dal Palù A; Dovier A; Fogolari F BMC Bioinformatics; 2004 Nov; 5():186. PubMed ID: 15571634 [TBL] [Abstract][Full Text] [Related]
76. The gene-duplication problem: near-linear time algorithms for NNI-based local searches. Bansal MS; Eulenstein O; Wehe A IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347 [TBL] [Abstract][Full Text] [Related]
77. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. Lu Z; Zhou Y; Hao JK IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807 [TBL] [Abstract][Full Text] [Related]
78. Solving NP-Hard Problems with Physarum-Based Ant Colony System. Liu Y; Gao C; Zhang Z; Lu Y; Chen S; Liang M; Tao L IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(1):108-120. PubMed ID: 28182547 [TBL] [Abstract][Full Text] [Related]
79. Hierarchical distribution of ascending slopes, nearly neutral networks, highlands, and local optima at the dth order in an NK fitness landscape. Aita T J Theor Biol; 2008 Sep; 254(2):252-63. PubMed ID: 18606171 [TBL] [Abstract][Full Text] [Related]