default search action
Marie-Eléonore Kessaci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j13]Clément Legrand, Diego Cattaruzza, Laetitia Jourdan, Marie-Eléonore Kessaci:
Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem. Int. Trans. Oper. Res. 32(1): 117-143 (2025) - 2024
- [c45]Clément Legrand
, Diego Cattaruzza
Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW. MIC (1) 2024: 62-77 - [c44]Clément Legrand
Solution-Based Knowledge Discovery for Multi-objective Optimization. PPSN (4) 2024: 83-99 - 2023
- [j12]Lucas M. Pavelski
Stochastic local search and parameters recommendation: a case study on flowshop problems. Int. Trans. Oper. Res. 30(2): 774-799 (2023) - [c43]Thomas Feutrier
When Simpler is Better: Automated Configuration of a University Timetabling Solver. CEC 2023: 1-8 - [c42]Clément Legrand
Improving MOEA/D with Knowledge Discovery. Application to a Bi-objective Routing Problem. EMO 2023: 462-475 - [c41]Thomas Feutrier
Improving the Relevance of Artificial Instances for Curriculum-Based Course Timetabling through Feasibility Prediction. GECCO Companion 2023: 203-206 - 2022
- [j11]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen
Preface to the Special Cluster on Stochastic Local Search: Recent Developments and Trends. Int. Trans. Oper. Res. 29(5): 2735-2736 (2022) - [c40]Clément Legrand
New Neighborhood Strategies for the Bi-objective Vehicle Routing Problem with Time Windows. MIC 2022: 45-60 - [c39]Lucas Marcondes Pavelski
A Novel Multi-objective Decomposition Formulation for Per-Instance Configuration. BRACIS (1) 2022: 325-339 - [c38]Thomas Feutrier, Nadarajen Veerapen, Marie-Eléonore Kessaci
Exploiting landscape features for fitness prediction in university timetabling. GECCO Companion 2022: 192-195 - [c37]Clément Legrand
Enhancing MOEA/D with learning: application to routing problems with time windows. GECCO Companion 2022: 495-498 - [c36]Thomas Feutrier
Analysis of Search Landscape Samplers for Solver Performance Prediction on a University Timetabling Problem. PPSN (1) 2022: 548-561 - 2021
- [c35]Lucas Marcondes Pavelski
Dynamic Learning in Hyper-Heuristics to Solve Flowshop Problems. BRACIS (1) 2021: 155-169 - [c34]Lucas Marcondes Pavelski
Local Optima Network Sampling for Permutation Flowshop. CEC 2021: 1131-1138 - [c33]Lucas Marcondes Pavelski
Flowshop NEH-Based Heuristic Recommendation. EvoCOP 2021: 136-151 - [c32]Thomas Feutrier, Marie-Eléonore Kessaci
Investigating the landscape of a hybrid local search approach for a timetabling problem. GECCO Companion 2021: 1665-1673 - [c31]Weerapan Sae-Dan, Marie-Eléonore Kessaci
Automatic Algorithm Multi-Configuration Applied to an Optimization Algorithm. HIS 2021: 160-170 - [c30]Laurent Parmentier, Olivier Nicol, Laetitia Jourdan, Marie-Eléonore Kessaci:
AutoTSC: Optimization Algorithm to Automatically Solve the Time Series Classification Problem. ICTAI 2021: 412-419 - 2020
- [j10]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 27(1): 697-698 (2020) - [j9]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 27(2): 1263-1264 (2020) - [j8]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 27(3): 1806-1807 (2020) - [j7]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 27(4): 2253-2254 (2020) - [j6]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 27(5): 2685-2686 (2020) - [c29]Sara Tari, Nicolas Szczepanski, Lucien Mousin, Julie Jacques, Marie-Eléonore Kessaci
Multi-objective Automatic Algorithm Configuration for the Classification Problem of Imbalanced Data. CEC 2020: 1-8 - [c28]Weerapan Sae-Dan, Marie-Eléonore Kessaci
Time-dependent automatic parameter configuration of a local search algorithm. GECCO Companion 2020: 1898-1905 - [c27]Sara Tari, Lucien Mousin, Julie Jacques, Marie-Eléonore Kessaci
Impact of the Discretization of VOCs for Cancer Prediction Using a Multi-Objective Algorithm. LION 2020: 151-157 - [c26]Sara Tari, Holger H. Hoos, Julie Jacques, Marie-Eléonore Kessaci
Automatic Configuration of a Multi-objective Local Search for Imbalanced Classification. PPSN (1) 2020: 65-77
2010 – 2019
- 2019
- [b2]Marie-Eléonore Kessaci:
Knowledge-based Design of Stochastic Local Search Algorithms in Combinatorial Optimization. University of Lille, France, 2019 - [j5]Aymeric Blot
Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems. Evol. Comput. 27(1): 147-171 (2019) - [j4]Holger H. Hoos, Laetitia Jourdan, Marie-Eléonore Kessaci, Thomas Stützle, Nadarajen Veerapen:
Special issue on "Stochastic Local Search: Recent developments and trends". Int. Trans. Oper. Res. 26(6): 2580-2581 (2019) - [c25]Camille Pageau, Aymeric Blot
Configuration of a Dynamic MOLS Algorithm for Bi-objective Flowshop Scheduling. EMO 2019: 565-577 - [c24]Lucas Marcondes Pavelski
Meta-learning on flowshop using fitness landscape analysis. GECCO 2019: 925-933 - [c23]Laurent Parmentier, Olivier Nicol, Laetitia Jourdan, Marie-Eléonore Kessaci
TPOT-SH: A Faster Optimization Algorithm to Solve the AutoML Problem on Large Datasets. ICTAI 2019: 471-478 - [i4]Lucien Mousin, Marie-Eléonore Kessaci, Clarisse Dhaenens:
Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem. CoRR abs/1903.09035 (2019) - 2018
- [j3]Aymeric Blot
Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation. J. Heuristics 24(6): 853-877 (2018) - [c22]Lucas Marcondes Pavelski
Recommending Meta-Heuristics and Configurations for the Flowshop Problem via Meta-Learning: Analysis and Design. BRACIS 2018: 163-168 - [c21]Lucas M. Pavelski
Meta-Learning for Optimization: A Case Study on the Flowshop Problem Using Decision Trees. CEC 2018: 1-8 - [c20]Aymeric Blot
Automatic Configuration of Bi-Objective Optimisation Algorithms: Impact of Correlation Between Objectives. ICTAI 2018: 571-578 - [c19]Aymeric Blot
Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem. LION 2018: 241-256 - [c18]Aymeric Blot
New Initialisation Techniques for Multi-objective Local Search - Application to the Bi-objective Permutation Flowshop. PPSN (1) 2018: 323-334 - 2017
- [c17]Aymeric Blot
Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation. EMO 2017: 61-76 - [c16]Marie-Éléonore Kessaci-Marmion
Neutral Neighbors in Bi-objective Optimization: Distribution of the Most Promising for Permutation Problems. EMO 2017: 344-358 - [c15]Aymeric Blot
Automatic design of multi-objective local search algorithms: case study on a bi-objective permutation flowshop scheduling problem. GECCO 2017: 227-234 - [c14]Lucien Mousin, Marie-Eléonore Kessaci
A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem. LION 2017: 196-209 - 2016
- [c13]Marie-Eléonore Marmion
Multi-objective Neutral Neighbors': What could be the definition(s)? GECCO 2016: 349-356 - [c12]Aymeric Blot
MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. LION 2016: 32-47 - [c11]Lucien Mousin, Laetitia Jourdan
Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search. LION 2016: 141-156 - 2015
- [c10]Aymeric Blot
Neutral but a Winner! How Neutrality Helps Multiobjective Local Search Algorithms. EMO (1) 2015: 34-47 - [c9]Marie-Eléonore Marmion
Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem. LION 2015: 151-164 - [e1]Clarisse Dhaenens
Learning and Intelligent Optimization - 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers. Lecture Notes in Computer Science 8994, Springer 2015, ISBN 978-3-319-19083-9 [contents] - 2014
- [c8]Manuel López-Ibáñez
A template for designing single-solution hybrid metaheuristics. GECCO (Companion) 2014: 1423-1426 - [c7]Franco Mascia, Manuel López-Ibáñez
Algorithm Comparison by Automatically Configurable Stochastic Local Search Frameworks: A Case Study Using Flow-Shop Scheduling Problems. Hybrid Metaheuristics 2014: 30-44 - 2013
- [j2]Marie-Eléonore Marmion
Local search and combinatorial optimization: from structural analysis of a problem to efficient algorithms design. 4OR 11(1): 99-100 (2013) - [j1]Marie-Eléonore Marmion
Fitness Landscape Analysis and Metaheuristics Efficiency. J. Math. Model. Algorithms 12(1): 3-26 (2013) - [c6]Marie-Eléonore Marmion
Automatic Design of Hybrid Stochastic Local Search Algorithms. Hybrid Metaheuristics 2013: 144-158 - [c5]Marie-Eléonore Marmion
Neutrality in the Graph Coloring Problem. LION 2013: 125-130 - 2012
- [i3]Marie-Eléonore Marmion, Clarisse Dhaenens
NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling. CoRR abs/1207.4450 (2012) - [i2]Marie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe
The Road to VEGAS: Guiding the Search over Neutral Networks. CoRR abs/1207.4626 (2012) - [i1]Marie-Eléonore Marmion, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe
On the Neutrality of Flowshop Scheduling Fitness Landscapes. CoRR abs/1207.4629 (2012) - 2011
- [b1]Marie-Eléonore Marmion:
Recherche locale et optimisation combinatoire : de l'analyse structurelle d'un problème à la conception d'algorithmes efficaces. (Local search and combinatorial optimization: from structural analysis of a problem to design efficient algorithms). Lille University of Science and Technology, France, 2011 - [c4]Marie-Eléonore Marmion
NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling. EvoCOP 2011: 191-202 - [c3]Marie-Eléonore Marmion
The road to VEGAS: guiding the search over neutral networks. GECCO 2011: 1979-1986 - [c2]Marie-Eléonore Marmion
On the Neutrality of Flowshop Scheduling Fitness Landscapes. LION 2011: 238-252 - 2010
- [c1]Marie-Eléonore Marmion
Comparison of neighborhoods for the HFF-AVRP. AICCSA 2010: 1-7
Coauthor Index
aka: Myriam R. B. S. Delgado
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-10-04 21:01 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: