default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthieu Basseur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Matthieu Basseur, Arnaud Liefooghe, Sara Tari:
MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. CEC 2024: 1-8- [c25]Rong-Qiang Zeng, Matthieu Basseur, Li-Yuan Xue:
Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. ICIC (1) 2024: 159-168 - 2023
- [j15]Sara Tari
, Matthieu Basseur, Adrien Goëffon:
Expansion-based Hill-climbing. Inf. Sci. 649: 119635 (2023) - [c24]Sara Tari, Gabriela Ochoa, Matthieu Basseur, Sébastien Vérel:
On the Global Structure of PUBOi Fitness Landscapes. GECCO Companion 2023: 247-250 - [c23]Rong-Qiang Zeng, Li-Yuan Xue, Matthieu Basseur:
Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. ICIC (1) 2023: 59-67 - 2022
- [j14]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Partial neighborhood local searches. Int. Trans. Oper. Res. 29(5): 2761-2788 (2022) - [c22]Rong-Qiang Zeng, Matthieu Basseur:
Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. ICIC (1) 2022: 123-131 - 2021
- [j13]Sara Tari, Matthieu Basseur, Adrien Goëffon:
On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. 20(3): 345-361 (2021)
2010 – 2019
- 2019
- [j12]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. 104: 1-14 (2019) - 2018
- [j11]Imen Ben Mansour, Matthieu Basseur, Frédéric Saubion:
A multi-population algorithm for multi-objective knapsack problem. Appl. Soft Comput. 70: 814-825 (2018) - [c21]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Worst Improvement Based Iterated Local Search. EvoCOP 2018: 50-66 - 2017
- [j10]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. 71: 457-468 (2017) - [c20]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution 2017: 47-57 - 2016
- [c19]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) 2016: 55-56 - [c18]Matthieu Basseur, Bilel Derbel, Adrien Goëffon, Arnaud Liefooghe:
Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection. GECCO 2016: 541-548 - 2015
- [j9]Matthieu Basseur, Adrien Goëffon:
Climbing combinatorial fitness landscapes. Appl. Soft Comput. 30: 688-704 (2015) - [c17]Pierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Empirical Analysis of Operators for Permutation Based Problems. LION 2015: 137-150 - [c16]Matthieu Basseur, Adrien Goëffon, Hugo Traverson:
Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION 2015: 165-169 - [c15]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. LION 2015: 249-255 - 2014
- [b1]Matthieu Basseur:
Analyse et conception de recherches locales génériques pour l'optimisation combinatoire à un ou plusieurs objectifs. University of Angers, France, 2014 - [c14]Matthieu Basseur, Adrien Goëffon:
On the efficiency of worst improvement for climbing NK-landscapes. GECCO 2014: 413-420 - [c13]Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron:
On the Attainability of NK Landscapes Global Optima. SOCS 2014: 28-34 - 2013
- [j8]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. 13(10): 4118-4132 (2013) - [c12]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO 2013: 185-199 - [c11]Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
On set-based local search for multiobjective combinatorial optimization. GECCO 2013: 471-478 - [c10]Matthieu Basseur, Adrien Goëffon:
Hill-climbing strategies on various landscapes: an empirical comparison. GECCO 2013: 479-486 - [c9]Matthieu Basseur, Adrien Goëffon:
Hill-Climbing Behavior on Quantized NK-Landscapes. LION 2013: 209-214 - 2012
- [j7]Arnaud Liefooghe, Matthieu Basseur, Jérémie Humeau, Laetitia Jourdan, El-Ghazali Talbi:
On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. Comput. Math. Appl. 64(12): 3747-3762 (2012) - [j6]Matthieu Basseur, Arnaud Liefooghe, Khoi N. Le, Edmund K. Burke:
The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2): 263-296 (2012) - [j5]El-Ghazali Talbi, Matthieu Basseur, Antonio J. Nebro, Enrique Alba:
Multi-objective optimization using metaheuristics: non-standard algorithms. Int. Trans. Oper. Res. 19(1-2): 283-305 (2012) - [j4]Matthieu Basseur, Rong-Qiang Zeng, Jin-Kao Hao:
Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8): 1917-1929 (2012)
2000 – 2009
- 2009
- [j3]Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi:
Hybridizing exact methods and metaheuristics: A taxonomy. Eur. J. Oper. Res. 199(3): 620-629 (2009) - 2008
- [j2]Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi:
Métaheuristiques pour le flow-shop de permutation bi-objectif stochastique. Rev. d'Intelligence Artif. 22(2): 183-208 (2008) - [c8]Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke:
Metaheuristics for the Bi-objective Ring Star Problem. EvoCOP 2008: 206-217 - 2007
- [c7]Matthieu Basseur, Edmund K. Burke:
Indicator-based multi-objective local search. IEEE Congress on Evolutionary Computation 2007: 3100-3107 - [c6]Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi:
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization. EMO 2007: 386-400 - [c5]Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourdan, El-Ghazali Talbi:
Combinatorial Optimization of Stochastic Multi-objective Problems: An Application to the Flow-Shop Scheduling Problem. EMO 2007: 457-471 - 2006
- [j1]Matthieu Basseur:
Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR 4(3): 255-258 (2006) - [c4]Matthieu Basseur, Eckart Zitzler:
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization. EvoWorkshops 2006: 727-739 - 2005
- [c3]Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi:
Path Relinking in Pareto Multi-objective Genetic Algorithms. EMO 2005: 120-134 - 2004
- [c2]Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi:
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. WEA 2004: 72-86 - 2002
- [c1]Matthieu Basseur, Franck Seynhaeve, El-Ghazali Talbi:
Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. IEEE Congress on Evolutionary Computation 2002: 1151-1156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
