OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes
Fabio Daolio, Arnaud Liefooghe, Sebástien Vérel, et al.
Evolutionary Computation (2016) Vol. 25, Iss. 4, pp. 555-585
Open Access | Times Cited: 23

Showing 23 citing articles:

Automated Algorithm Selection on Continuous Black-Box Problems by Combining Exploratory Landscape Analysis and Machine Learning
Pascal Kerschke, Heike Trautmann
Evolutionary Computation (2018) Vol. 27, Iss. 1, pp. 99-127
Open Access | Times Cited: 148

Landscape-Aware Performance Prediction for Evolutionary Multiobjective Optimization
Arnaud Liefooghe, Fabio Daolio, Sebástien Vérel, et al.
IEEE Transactions on Evolutionary Computation (2019) Vol. 24, Iss. 6, pp. 1063-1077
Open Access | Times Cited: 65

Characterization of constrained continuous multiobjective optimization problems: A feature space perspective
Aljoša Vodopija, Tea Tušar, Bogdan Filipić
Information Sciences (2022) Vol. 607, pp. 244-262
Open Access | Times Cited: 21

What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization
Richard Allmendinger, Andrzej Jaszkiewicz, Arnaud Liefooghe, et al.
Computers & Operations Research (2022) Vol. 145, pp. 105857-105857
Open Access | Times Cited: 20

Search Dynamics on Multimodal Multiobjective Problems
Pascal Kerschke, Hao Wang, Mike Preuß, et al.
Evolutionary Computation (2018) Vol. 27, Iss. 4, pp. 577-609
Open Access | Times Cited: 25

On Pareto Local Optimal Solutions Networks
Arnaud Liefooghe, Bilel Derbel, Sebástien Vérel, et al.
Lecture notes in computer science (2018), pp. 232-244
Open Access | Times Cited: 24

Decision/Objective Space Trajectory Networks for Multi-objective Combinatorial Optimisation
Gabriela Ochoa, Arnaud Liefooghe, Yuri Lavinas, et al.
Lecture notes in computer science (2023), pp. 211-226
Closed Access | Times Cited: 5

Running Time Analysis of MOEA/D on Pseudo-Boolean Functions
Zhengxin Huang, Yuren Zhou, Zefeng Chen, et al.
IEEE Transactions on Cybernetics (2019) Vol. 51, Iss. 10, pp. 5130-5141
Closed Access | Times Cited: 12

Algorithm selection of anytime algorithms
Alexandre D. Jesus, Arnaud Liefooghe, Bilel Derbel, et al.
Proceedings of the Genetic and Evolutionary Computation Conference (2020), pp. 850-858
Open Access | Times Cited: 12

Theoretical Study of Optimizing Rugged Landscapes with the cGA
Tobias Friedrich, Timo Kötzing, Frank Neumann, et al.
Lecture notes in computer science (2022), pp. 586-599
Open Access | Times Cited: 6

New Multi-objectives Scheduling Strategies in Docker SwarmKit
Tarek Menouer, Christophe Cérin, Étienne Leclercq
Lecture notes in computer science (2018), pp. 103-117
Closed Access | Times Cited: 7

Multi-objective NK landscapes with heterogeneous objectives
Raphaël Cosson, Roberto Santana, Bilel Derbel, et al.
Proceedings of the Genetic and Evolutionary Computation Conference (2022), pp. 502-510
Open Access | Times Cited: 4

Analysis of Search Landscape Samplers for Solver Performance Prediction on a University Timetabling Problem
Thomas Feutrier, Marie‐Éléonore Kessaci, Nadarajen Veerapen
Lecture notes in computer science (2022), pp. 548-561
Open Access | Times Cited: 4

A metaheuristic-based efficient strategy for multi-unit production planning with unique process constraints
Remya Kommadath, Debasis Maharana, Prakash Kotecha
Applied Soft Computing (2022) Vol. 134, pp. 109871-109871
Closed Access | Times Cited: 4

Fitness landscapes analysis and adaptive algorithms design for traffic lights optimization on SIALAC benchmark
Florian Leprêtre, Cyril Fonlupt, Sebástien Vérel, et al.
Applied Soft Computing (2019) Vol. 85, pp. 105869-105869
Open Access | Times Cited: 5

Funnels in Multi-objective Fitness Landscapes
Gabriela Ochoa, Arnaud Liefooghe, Sebástien Vérel
Lecture notes in computer science (2024), pp. 343-359
Closed Access

On the use of $$(1,\lambda )$$-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis
Sara Tari, Matthieu Basseur, Adrien Goëffon
Natural Computing (2020) Vol. 20, Iss. 3, pp. 345-361
Closed Access | Times Cited: 4

A Syntactic Problem Solver Learning Landscape Structures for Clinical Scheduling
Keyao Wang, Bo Liu
IEEE Transactions on Evolutionary Computation (2024), pp. 1-1
Open Access

A Fitness Landscape Analysis of Pareto Local Search on Bi-objective Permutation Flowshop Scheduling Problems
Arnaud Liefooghe, Bilel Derbel, Sebástien Vérel, et al.
Lecture notes in computer science (2017), pp. 422-437
Open Access | Times Cited: 3

Accelerating the Computation of Multi-Objectives Scheduling Solutions for Cloud Computing
Christophe Cérin, Tarek Menouer, Mustapha Lebbah
(2018), pp. 49-56
Closed Access | Times Cited: 2

Many-objective (Combinatorial) Optimization is Easy
Arnaud Liefooghe, Manuel López‐Ibáñez
Proceedings of the Genetic and Evolutionary Computation Conference (2023), pp. 704-712
Open Access

Random walk’s correlation function for multi-objective NK landscapes and quadratic assignment problem
Mădălina M. Drugan
Journal of Combinatorial Optimization (2019) Vol. 38, Iss. 4, pp. 1213-1262
Closed Access

Analysing Multiobjective Optimization Using Evolutionary Path Length Correlation
Daniel Herring, Dean Pakravan, Michael Kirley
Lecture notes in computer science (2022), pp. 467-479
Closed Access

Page 1

Scroll to top