Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search. - Thibaut Lust (GECCO, 2008)

MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. - Thibaut Lust; Jacques Teghem (RAIRO Oper. Res., 2008)

Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy. - Thibaut Lust; Jacques Teghem (EMO, 2009)

Exact and heuristic methods for the selective maintenance problem. - Thibaut Lust; Olivier Roux 001; Fouad Riane (Eur. J. Oper. Res., 2009)

Speed-up techniques for solving large-scale biobjective TSP. - Thibaut Lust; Andrzej Jaszkiewicz (Comput. Oper. Res., 2010)

Multiobjective decomposition of integer matrices: application to radiotherapy - Thibaut Lust; Jacques Teghem (CoRR, 2010)

Two-phase Pareto local search for the biobjective traveling salesman problem. - Thibaut Lust; Jacques Teghem (J. Heuristics, 2010)

The Multiobjective Traveling Salesman Problem: A Survey and a New Approach. - Thibaut Lust; Jacques Teghem (Advances in Multi-Objective Nature Inspired Computing, 2010)

Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. - Thibaut Lust; Jacques Teghem; Daniel Tuyttens (EMO, 2011)

Multi-objective approaches for the open-pit mining operational planning problem. - Vitor Nazário Coelho; Marcone J. F. Souza; Igor Machado Coelho; Frederico G. Guimarães; Thibaut Lust; R. C. Cruz (Electron. Notes Discret. Math., 2012)

The multiobjective multidimensional knapsack problem: a survey and a new approach. - Thibaut Lust; Jacques Teghem (Int. Trans. Oper. Res., 2012)

On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts. - Thibaut Lust; Antoine Rolland (MIWAI, 2013)

Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem. - Thibaut Lust; Daniel Tuyttens (TAAI, 2013)

Choquet optimal set in biobjective combinatorial optimization. - Thibaut Lust; Antoine Rolland (Comput. Oper. Res., 2013)

2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems. - Thibaut Lust; Antoine Rolland (IPMU (1), 2014)

Predicting academic success in Belgium and France Comparison and integration of variables related to student behavior. - Thibaut Lust; Nadine Meskens; Mario Ahues (CoRR, 2014)

Variable and large neighborhood search to solve the multiobjective set covering problem. - Thibaut Lust; Daniel Tuyttens (J. Heuristics, 2014)

Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems. - Lucie Galand; Thibaut Lust (ADT, 2015)

Choquet Integral Versus Weighted Sum in Multicriteria Decision Contexts. - Thibaut Lust (ADT, 2015)

Multiagent Fair Optimization with Lorenz Dominance. - Lucie Galand; Thibaut Lust (AAMAS, 2015)

ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search. - Andrzej Jaszkiewicz; Thibaut Lust (CoRR, 2016)

Proper balance between search towards and along Pareto front: biobjective TSP case study. - Andrzej Jaszkiewicz; Thibaut Lust (Ann. Oper. Res., 2017)

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. - Vitor Nazário Coelho; Thays A. Oliveira; Igor Machado Coelho; Bruno N. Coelho; Peter J. Fleming; Frederico G. Guimarães; Helena Ramalhinho Dias Lourenço; Marcone J. F. Souza; El-Ghazali Talbi; Thibaut Lust (Comput. Oper. Res., 2017)

A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem. - Luciano Costa; Thibaut Lust; Raphael Kramer; Anand Subramanian 001 (Networks, 2018)

ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem. - Andrzej Jaszkiewicz; Thibaut Lust (IEEE Trans. Evol. Comput., 2018)

Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust; Patrice Perny (ADT, 2019)

A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. - Nawal Benabbou; Thibaut Lust (SOCS, 2019)

An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information. - Nawal Benabbou; Thibaut Lust (SUM, 2019)

An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust (AAAI, 2020)

Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust (ECAI, 2020)

Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust; Patrice Perny (AAAI, 2021)

Interactive Optimization of Submodular Functions Under Matroid Constraints. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust; Patrice Perny (ADT, 2021)

RIGA: A Regret-Based Interactive Genetic Algorithm. - Nawal Benabbou; Cassandre Leroy; Thibaut Lust (CoRR, 2023)

Exploring New Horizons in Multi-Objective Combinatorial Optimization: From Pareto Generation to Interactive Methods. - Thibaut Lust (2024)

Generating Fair Solutions of Minimal Cost. - Mohammed Bachir Bederina; Djamal Chaabane; Thibaut Lust (ECAI, 2024)