33 citations to 10.1057/palgrave.jors.2601611 (Crossref Cited-By Service)
  1. Garrison W. Greenwood, 2011 IEEE Congress of Evolutionary Computation (CEC), 2011, 463  crossref
  2. Khulood Alyahya, Jonathan E. Rowe, 9921, Parallel Problem Solving from Nature – PPSN XIV, 2016, 932  crossref
  3. Wei Li, Shanni Li, Zhangxin Chen, Liang Zhong, Chengtian Ouyang, “Self-feedback differential evolution adapting to fitness landscape characteristics”, Soft Comput, 23, no. 4, 2019, 1151  crossref
  4. Adam Prugel-Bennett, Mohammad-Hassan Tayarani-Najaran, “Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem”, IEEE Trans. Evol. Computat., 16, no. 3, 2012, 319  crossref
  5. S. Sahoo, A.A. Albrecht, “Approximating the set of local minima in partial RNA folding landscapes”, Bioinformatics, 28, no. 4, 2012, 523  crossref
  6. Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, “Features for the 0-1 knapsack problem based on inclusionwise maximal solutions”, European Journal of Operational Research, 311, no. 1, 2023, 36  crossref
  7. Anton V. Eremeev, Alexander S. Yurkov, 12095, Mathematical Optimization Theory and Operations Research, 2020, 35  crossref
  8. Mario A. Muñoz, Michael Kirley, Saman K. Halgamuge, 445, Computational Intelligence in Intelligent Data Analysis, 2013, 75  crossref
  9. Madalina M. Drugan, “Estimating the number of basins of attraction of multi-objective combinatorial problems”, J Comb Optim, 37, no. 4, 2019, 1367  crossref
  10. Anton V. Eremeev, Yulia V. Kovalenko, “A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Memetic Comp., 12, no. 1, 2020, 23  crossref
1
2
3
4
Next