Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. - Matthieu Basseur; Franck Seynhaeve; El-Ghazali Talbi (IEEE Congress on Evolutionary Computation, 2002)

Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. - Matthieu Basseur; Julien Lemesre; Clarisse Dhaenens; El-Ghazali Talbi (WEA, 2004)

Path Relinking in Pareto Multi-objective Genetic Algorithms. - Matthieu Basseur; Franck Seynhaeve; El-Ghazali Talbi (EMO, 2005)

A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization. - Matthieu Basseur; Eckart Zitzler (EvoWorkshops, 2006)

Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. - Matthieu Basseur (4OR, 2006)

Indicator-based multi-objective local search. - Matthieu Basseur; Edmund K. Burke (IEEE Congress on Evolutionary Computation, 2007)

ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization. - Arnaud Liefooghe; Matthieu Basseur; Laetitia Jourdan; El-Ghazali Talbi (EMO, 2007)

Combinatorial Optimization of Stochastic Multi-objective Problems: An Application to the Flow-Shop Scheduling Problem. - Arnaud Liefooghe; Matthieu Basseur; Laetitia Jourdan; El-Ghazali Talbi (EMO, 2007)

Metaheuristics for the Bi-objective Ring Star Problem. - Arnaud Liefooghe; Laetitia Jourdan; Matthieu Basseur; El-Ghazali Talbi; Edmund K. Burke (EvoCOP, 2008)

Métaheuristiques pour le flow-shop de permutation bi-objectif stochastique. - Arnaud Liefooghe; Laetitia Jourdan; Matthieu Basseur; El-Ghazali Talbi (Rev. d'Intelligence Artif., 2008)

Hybridizing exact methods and metaheuristics: A taxonomy. - Laetitia Jourdan; Matthieu Basseur; El-Ghazali Talbi (Eur. J. Oper. Res., 2009)

On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. - Arnaud Liefooghe; Matthieu Basseur; Jérémie Humeau; Laetitia Jourdan; El-Ghazali Talbi (Comput. Math. Appl., 2012)

The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. - Matthieu Basseur; Arnaud Liefooghe; Khoi N. Le; Edmund K. Burke (J. Heuristics, 2012)

Multi-objective optimization using metaheuristics: non-standard algorithms. - El-Ghazali Talbi; Matthieu Basseur; Antonio J. Nebro; Enrique Alba 001 (Int. Trans. Oper. Res., 2012)

Hypervolume-based multi-objective local search. - Matthieu Basseur; Rong-Qiang Zeng; Jin-Kao Hao (Neural Comput. Appl., 2012)

Hypervolume-Based Multi-Objective Path Relinking Algorithm. - Rong-Qiang Zeng; Matthieu Basseur; Jin-Kao Hao (EMO, 2013)

Hill-climbing strategies on various landscapes: an empirical comparison. - Matthieu Basseur; Adrien Goëffon (GECCO, 2013)

On set-based local search for multiobjective combinatorial optimization. - Matthieu Basseur; Adrien Goëffon; Arnaud Liefooghe; Sébastien Vérel (GECCO, 2013)

Hill-Climbing Behavior on Quantized NK-Landscapes. - Matthieu Basseur; Adrien Goëffon (LION, 2013)

Solving bi-objective flow shop problem with hybrid path relinking algorithm. - Rong-Qiang Zeng; Matthieu Basseur; Jin-Kao Hao (Appl. Soft Comput., 2013)

Analyse et conception de recherches locales génériques pour l'optimisation combinatoire à un ou plusieurs objectifs. - Matthieu Basseur (2014)

On the efficiency of worst improvement for climbing NK-landscapes. - Matthieu Basseur; Adrien Goëffon (GECCO, 2014)

On the Attainability of NK Landscapes Global Optima. - Matthieu Basseur; Adrien Goëffon; Frédéric Lardeux; Frédéric Saubion; Vincent Vigneron (SOCS, 2014)

Exploring Non-neutral Landscapes with Neutrality-Based Local Search. - Matthieu Basseur; Adrien Goëffon; Hugo Traverson (LION, 2015)

A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. - Brahim Chabane; Matthieu Basseur; Jin-Kao Hao (LION, 2015)

Empirical Analysis of Operators for Permutation Based Problems. - Pierre Desport; Matthieu Basseur; Adrien Goëffon; Frédéric Lardeux; Frédéric Saubion (LION, 2015)

Climbing combinatorial fitness landscapes. - Matthieu Basseur; Adrien Goëffon (Appl. Soft Comput., 2015)

Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection. - Matthieu Basseur; Bilel Derbel; Adrien Goëffon; Arnaud Liefooghe (GECCO, 2016)

Toward the Design of Efficient Pivoting Rules for Local Search. - Sara Tari; Matthieu Basseur; Adrien Goëffon (GECCO (Companion), 2016)

Sampled Walk and Binary Fitness Landscapes Exploration. - Sara Tari; Matthieu Basseur; Adrien Goëffon (Artificial Evolution, 2017)

R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. - Brahim Chabane; Matthieu Basseur; Jin-Kao Hao (Expert Syst. Appl., 2017)

Worst Improvement Based Iterated Local Search. - Sara Tari; Matthieu Basseur; Adrien Goëffon (EvoCOP, 2018)

A multi-population algorithm for multi-objective knapsack problem. - Imen Ben Mansour; Matthieu Basseur; Frédéric Saubion (Appl. Soft Comput., 2018)

Lorenz dominance based algorithms to solve a practical multiobjective problem. - Brahim Chabane; Matthieu Basseur; Jin-Kao Hao (Comput. Oper. Res., 2019)

On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. - Sara Tari; Matthieu Basseur; Adrien Goëffon (Nat. Comput., 2021)

Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. - Rong-Qiang Zeng; Matthieu Basseur (ICIC (1), 2022)

Partial neighborhood local searches. - Sara Tari; Matthieu Basseur; Adrien Goëffon (Int. Trans. Oper. Res., 2022)

On the Global Structure of PUBOi Fitness Landscapes. - Sara Tari; Gabriela Ochoa; Matthieu Basseur; Sébastien Vérel (GECCO Companion, 2023)

Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. - Rong-Qiang Zeng; Li-Yuan Xue; Matthieu Basseur (ICIC (1), 2023)

Expansion-based Hill-climbing. - Sara Tari; Matthieu Basseur; Adrien Goëffon (Inf. Sci., 2023)

MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. - Matthieu Basseur; Arnaud Liefooghe; Sara Tari (CEC, 2024)

Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. - Rong-Qiang Zeng; Matthieu Basseur; Li-Yuan Xue (ICIC (1), 2024)

Diversification Through Candidate Sampling for a Non-iterated Lin-Kernighan-Helsgaun Algorithm. - Tarek Boufar; Omar Rifki; Matthieu Basseur (EvoCOP@EvoStar, 2025)