Thibaut Lust

Orcid: 0000-0001-8433-518X

According to our database1, Thibaut Lust authored at least 33 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
RIGA: A Regret-Based Interactive Genetic Algorithm.
CoRR, 2023

2021
Interactive Optimization of Submodular Functions Under Matroid Constraints.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information.
Proceedings of the Scalable Uncertainty Management - 13th International Conference, 2019

A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization.
Proceedings of the Algorithmic Decision Theory - 6th International Conference, 2019

2018
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem.
IEEE Trans. Evol. Comput., 2018

A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem.
Networks, 2018

2017
Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign.
Comput. Oper. Res., 2017

Proper balance between search towards and along Pareto front: biobjective TSP case study.
Ann. Oper. Res., 2017

2016
ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search.
CoRR, 2016

2015
Multiagent Fair Optimization with Lorenz Dominance.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Choquet Integral Versus Weighted Sum in Multicriteria Decision Contexts.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
Variable and large neighborhood search to solve the multiobjective set covering problem.
J. Heuristics, 2014

Predicting academic success in Belgium and France Comparison and integration of variables related to student behavior.
CoRR, 2014

2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014

2013
Choquet optimal set in biobjective combinatorial optimization.
Comput. Oper. Res., 2013

Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2013

On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts.
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2013

2012
The multiobjective multidimensional knapsack problem: a survey and a new approach.
Int. Trans. Oper. Res., 2012

Multi-objective approaches for the open-pit mining operational planning problem.
Electron. Notes Discret. Math., 2012

2011
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2011

2010
The Multiobjective Traveling Salesman Problem: A Survey and a New Approach.
Proceedings of the Advances in Multi-Objective Nature Inspired Computing, 2010

Two-phase Pareto local search for the biobjective traveling salesman problem.
J. Heuristics, 2010

Multiobjective decomposition of integer matrices: application to radiotherapy
CoRR, 2010

Speed-up techniques for solving large-scale biobjective TSP.
Comput. Oper. Res., 2010

2009
Exact and heuristic methods for the selective maintenance problem.
Eur. J. Oper. Res., 2009

Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy.
Proceedings of the Evolutionary Multi-Criterion Optimization, 5th International Conference, 2009

2008
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization.
RAIRO Oper. Res., 2008

Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008


  Loading...