187 related articles for article (PubMed ID: 30365387)
1. Landscape Analysis of a Class of NP-Hard Binary Packing Problems.
Alyahya K; Rowe JE
Evol Comput; 2019; 27(1):47-73. PubMed ID: 30365387
[TBL] [Abstract][Full Text] [Related]
2. Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty.
Moser I; Gheorghita M; Aleti A
Evol Comput; 2017; 25(3):407-437. PubMed ID: 26928851
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
Drake JH; Özcan E; Burke EK
Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
[TBL] [Abstract][Full Text] [Related]
5. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
Ceberio J; Calvo B; Mendiburu A; Lozano JA
Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
[TBL] [Abstract][Full Text] [Related]
6. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
Pourhassan M; Neumann F
Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364
[TBL] [Abstract][Full Text] [Related]
7. Anatomy of the Attraction Basins: Breaking with the Intuition.
Hernando L; Mendiburu A; Lozano JA
Evol Comput; 2019; 27(3):435-466. PubMed ID: 29786459
[TBL] [Abstract][Full Text] [Related]
8. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes.
Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K
Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467
[TBL] [Abstract][Full Text] [Related]
9. Inferring Future Landscapes: Sampling the Local Optima Level.
Thomson SL; Ochoa G; Verel S; Veerapen N
Evol Comput; 2020; 28(4):621-641. PubMed ID: 32101026
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Advanced fitness landscape analysis and the performance of memetic algorithms.
Merz P
Evol Comput; 2004; 12(3):303-25. PubMed ID: 15355603
[TBL] [Abstract][Full Text] [Related]
12. Multidimensional knapsack problem: a fitness landscape analysis.
Tavares J; Pereira FB; Costa E
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):604-16. PubMed ID: 18558527
[TBL] [Abstract][Full Text] [Related]
13. Chemical reaction optimization for solving shortest common supersequence problem.
Khaled Saifullah CM; Rafiqul Islam M
Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
[TBL] [Abstract][Full Text] [Related]
14. Quasi-combinatorial energy landscapes for nanoalloy structure optimisation.
Schebarchov D; Wales DJ
Phys Chem Chem Phys; 2015 Nov; 17(42):28331-8. PubMed ID: 25970479
[TBL] [Abstract][Full Text] [Related]
15. Evolutionary algorithm using surrogate models for solving bilevel multiobjective programming problems.
Liu Y; Li H; Li H
PLoS One; 2020; 15(12):e0243926. PubMed ID: 33332433
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Automated Algorithm Selection: Survey and Perspectives.
Kerschke P; Hoos HH; Neumann F; Trautmann H
Evol Comput; 2019; 27(1):3-45. PubMed ID: 30475672
[TBL] [Abstract][Full Text] [Related]
18. A study of fitness distance correlation as a difficulty measure in genetic programming.
Tomassini M; Vanneschi L; Collard P; Clergue M
Evol Comput; 2005; 13(2):213-39. PubMed ID: 15969901
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. A lifelong learning hyper-heuristic method for bin packing.
Sim K; Hart E; Paechter B
Evol Comput; 2015; 23(1):37-67. PubMed ID: 24512321
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
