Matthieu Basseur

43 papers A 4B 6C 4Journal 15Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Diversification Through Candidate Sampling for a Non-iterated Lin-Kernighan-Helsgaun Algorithm. EvoCOP@EvoStar Tarek Boufar, Omar Rifki, Matthieu Basseur
2024	B	`conf`	MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. CEC Matthieu Basseur, Arnaud Liefooghe, Sara Tari
2024	—	`conf`	Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. ICIC (1) Rong-Qiang Zeng, Matthieu Basseur, Li-Yuan Xue
2023	—	`conf`	Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. ICIC (1) Rong-Qiang Zeng, Li-Yuan Xue, Matthieu Basseur
2023	J	`jnl`	Expansion-based Hill-climbing. Inf. Sci. Sara Tari, Matthieu Basseur, Adrien Goëffon
2023	—	`conf`	On the Global Structure of PUBOi Fitness Landscapes. GECCO Companion Sara Tari, Gabriela Ochoa, Matthieu Basseur, Sébastien Vérel
2022	—	`conf`	Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. ICIC (1) Rong-Qiang Zeng, Matthieu Basseur
2022	J	`jnl`	Partial neighborhood local searches. Int. Trans. Oper. Res. Sara Tari, Matthieu Basseur, Adrien Goëffon
2021	J	`jnl`	On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. Sara Tari, Matthieu Basseur, Adrien Goëffon
2019	J	`jnl`	Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
2018	J	`jnl`	A multi-population algorithm for multi-objective knapsack problem. Appl. Soft Comput. Imen Ben Mansour, Matthieu Basseur, Frédéric Saubion
2018	B	`conf`	Worst Improvement Based Iterated Local Search. EvoCOP Sara Tari, Matthieu Basseur, Adrien Goëffon
2017	J	`jnl`	R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
2017	—	`conf`	Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution Sara Tari, Matthieu Basseur, Adrien Goëffon
2016	A	`conf`	Experiments on Greedy and Local Search Heuristics for GECCO Matthieu Basseur, Bilel Derbel, Adrien Goëffon, Arnaud Liefooghe
2016	—	`conf`	Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) Sara Tari, Matthieu Basseur, Adrien Goëffon
2015	—	`conf`	A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. LION Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
2015	J	`jnl`	Climbing combinatorial fitness landscapes. Appl. Soft Comput. Matthieu Basseur, Adrien Goëffon
2015	—	`conf`	Empirical Analysis of Operators for Permutation Based Problems. LION Pierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion
2015	—	`conf`	Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION Matthieu Basseur, Adrien Goëffon, Hugo Traverson
2014	—	`book`	Analyse et conception de recherches locales génériques pour l'optimisation combinatoire à un ou plusieurs objectifs. Matthieu Basseur
2014	B	`conf`	On the Attainability of NK Landscapes Global Optima. SOCS Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron
2014	A	`conf`	On the efficiency of worst improvement for climbing NK-landscapes. GECCO Matthieu Basseur, Adrien Goëffon
2013	—	`conf`	Hill-Climbing Behavior on Quantized NK-Landscapes. LION Matthieu Basseur, Adrien Goëffon
2013	A	`conf`	Hill-climbing strategies on various landscapes: an empirical comparison. GECCO Matthieu Basseur, Adrien Goëffon
2013	C	`conf`	Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao
2013	A	`conf`	On set-based local search for multiobjective combinatorial optimization. GECCO Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel
2013	J	`jnl`	Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao
2012	J	`jnl`	Hypervolume-based multi-objective local search. Neural Comput. Appl. Matthieu Basseur, Rong-Qiang Zeng, Jin-Kao Hao
2012	J	`jnl`	Multi-objective optimization using metaheuristics: non-standard algorithms. Int. Trans. Oper. Res. El-Ghazali Talbi, Matthieu Basseur, Antonio J. Nebro, Enrique Alba
2012	J	`jnl`	On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. Comput. Math. Appl. Arnaud Liefooghe, Matthieu Basseur, Jérémie Humeau, Laetitia Jourdan, El-Ghazali Talbi
2012	J	`jnl`	The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics Matthieu Basseur, Arnaud Liefooghe, Khoi N. Le, Edmund K. Burke
2009	J	`jnl`	Hybridizing exact methods and metaheuristics: A taxonomy. Eur. J. Oper. Res. Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi
2008	B	`conf`	Metaheuristics for the Bi-objective Ring Star Problem. EvoCOP Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke
2008	J	`jnl`	Métaheuristiques pour le flow-shop de permutation bi-objectif stochastique. Rev. d'Intelligence Artif. Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi
2007	C	`conf`	Combinatorial Optimization of Stochastic Multi-objective Problems: An Application to the Flow-Shop Scheduling Problem. EMO Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi
2007	B	`conf`	Indicator-based multi-objective local search. IEEE Congress on Evolutionary Computation Matthieu Basseur, Edmund K. Burke
2007	C	`conf`	ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization. EMO Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi
2006	—	`conf`	A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization. EvoWorkshops Matthieu Basseur, Eckart Zitzler
2006	J	`jnl`	Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR Matthieu Basseur
2005	C	`conf`	Path Relinking in Pareto Multi-objective Genetic Algorithms. EMO Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi
2004	—	`conf`	Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. WEA Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi
2002	B	`conf`	Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. IEEE Congress on Evolutionary Computation Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi