LUST Thibaut

Team : DECISION
- Sorbonne Université - LIP6
Boîte courrier 169
Couloir 26-00, Étage 4, Bureau 405
4 place Jussieu
75252 PARIS CEDEX 05
FRANCE
Tel: +33 1 44 27 24 40, Thibaut.Lust (at) nulllip6.fr
https://webia.lip6.fr/~lustt/
2007-2021 Publications
-
2021
- N. Benabbou, C. Leroy, Th. Lust, P. Perny : “Interactive Optimization of Submodular Functions under Matroid Constraints”, ADT 2021 - 7th International Conference on Algorithmic Decision Theory, vol. 13023, Lecture Notes in Computer Science book series, Toulouse, France, pp. 307-322, (Springer-Verlag), (ISBN: 978-3-030-87755-2) (2021)
- N. Benabbou, C. Leroy, Th. Lust, P. Perny : “Élicitation IncrĂ©mentale combinĂ©e Ă la Recherche Locale et Recherche Gloutonne pour l’Optimisation de MatroĂŻdes PondĂ©rĂ©s”, 22e congrès annuel de la sociĂ©tĂ© française de recherche opĂ©rationnelle et d'aide Ă la dĂ©cision, Mulhouse (en ligne), France (2021)
- N. Benabbou, C. Leroy, Th. Lust, P. Perny : “Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization”, Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI'21), Virtual, France (2021)
-
2020
- Th. Lust : “Les mĂ©taheuristiques pour traiter les problèmes NP-difficiles”, Bibliothèque Tangente, vol. Hors SĂ©rie (75), pp. 20-22, (Editions PĂ´le Paris) (2020)
- N. Benabbou, C. Leroy, Th. Lust : “Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators”, The 24th European Conference on Artificial Intelligence (ECAI'20), Saint Jacques de Compostelle, Spain (2020)
- N. Benabbou, C. Leroy, Th. Lust : “Élicitation IncrĂ©mentale combinĂ©e Ă la Recherche Heuristique pour l’Optimisation Combinatoire Multi-objectifs”, 21e congrès annuel de la sociĂ©tĂ© française de recherche opĂ©rationnelle et d'aide Ă la dĂ©cision, Montpellier, France (2020)
- N. Benabbou, C. Leroy, Th. Lust : “An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems”, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI'20), New York, United States (2020)
-
2019
- N. Benabbou, Th. Lust : “An Interactive Polyhedral Approach for Multi-Objective Combinatorial Optimization with Incomplete Preference Information”, SUM 2019 - The 13th international conference on Scalable Uncertainty Management, Compiègne, France (2019)
- N. Benabbou, C. Leroy, Th. Lust, P. Perny : “Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization”, ADT 2019 - 6th International Conference on Algorithmic Decision Theory, Durham, NC, United States (2019)
- N. Benabbou, Th. Lust : “A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences”, The International Symposium on Combinatorial Search (SoCS'19), Napa, United States (2019)
-
2018
- A. Jaszkiewicz, Th. Lust : “ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem”, (2018)
- L. Costa, Th. Lust, R. Kramer, A. Subramanian : “A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem”, Networks, vol. 72 (3), pp. 311-336, (Wiley) (2018)
- A. Jaszkiewicz, Th. Lust : “ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem”, IEEE Transactions on Evolutionary Computation, vol. 22 (5), pp. 778-791, (Institute of Electrical and Electronics Engineers) (2018)
-
2017
- A. Jaszkiewicz, Th. Lust : “Proper balance between search towards and along Pareto front: biobjective TSP case study”, Annals of Operations Research, vol. 254 (1-2), pp. 111-130, (Springer Verlag) (2017)
- V. Coelho, Th. Oliveira, I. Coelho, B. Coelho, P. Fleming, F. GuimarĂŁes, H. Ramalhinho, M. Souza, E.‑Gh. Talbi, Th. Lust : “Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign”, Computers and Operations Research, vol. 78, pp. 578-587, (Elsevier) (2017)
-
2015
- Th. Lust : “Choquet integral versus weighted sum in multicriteria decision contexts”, 3rd International Conference on Algorithmic Decision Theory (ADT 2015), vol. 9346, Lecture Notes in Computer Science, Lexington, KY, United States, pp. 288-304, (Springer International Publishing) (2015)
- L. Galand, Th. Lust : “Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems”, Algorithmic Decision Theory, vol. 9346, Lecture Notes in Computer Science, Lexington, United States, pp. 305-321, (Springer) (2015)
- L. Galand, Th. Lust : “Multiagent Fair Optimization with Lorenz Dominance”, Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems (AAMAS 15), Istanbul, Turkey, pp. 1895-1896 (2015)
-
2014
- Th. Lust, A. Rolland : “2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems”, Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU), vol. 442, Communications in Computer and Information Science, Montpellier, France, pp. 256-265 (2014)
- Th. Lust, D. Tuyttens : “Variable and large neighborhood search to solve the multiobjective set covering problem”, Journal of Heuristics, vol. 20 (2), pp. 165-188, (Springer Verlag) (2014)
-
2013
- Th. Lust, A. Rolland : “On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts”, 7th International Workshop, MIWAI 2013, vol. 8271, Lecture Notes in Computer Science, Krabi, Thailand, pp. 131-142, (Springer Berlin Heidelberg) (2013)
- Th. Lust, D. Tuyttens : “Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem”, Technologies and Applications of Artificial Intelligence (TAAI), Taipei, Taiwan, Province of China, pp. 397-402, (IEEE) (2013)
- Th. Lust, A. Rolland : “Choquet optimal set in biobjective combinatorial optimization”, Computers and Operations Research, vol. 40 (10), pp. 2260-2269, (Elsevier) (2013)
- Th. Lust, A. Rolland : “Generation of the Choquet optimal set of multiobjective combinatorial optimization problems”, 22nd International Conference on Multiple Criteria Decision Making, Malaga, Spain (2013)
- Th. Lust, A. Rolland : “GĂ©nĂ©ration de l’ensemble des solutions Choquet-optimales de problèmes d’optimisation combinatoire multi-objectif”, 14e congrès annuel de la sociĂ©tĂ© française de recherche opĂ©rationnelle et d'aide Ă la dĂ©cision, ROADEF 2013, Troyes, France (2013)
- L. Galand, Th. Lust : “Two phase method for Lorenz dominance in biobjective combinatorial optimization”, 26th European Conference on Operational Research (EURO 2013), Rome, Italy (2013)
-
2012
- Th. Lust, N. Meskens, Th. Monteiro : “Ordonnancement multiobjectif du bloc opĂ©ratoire avec une prise en compte d’une affectation Ă©quilibrĂ©e des compĂ©tences des infirmières”, Proceedings of MOSIM'12, Bordeaux, France (2012)
- V. N. Coelho, Marcone J. F. Souza, I. Coelho, Frederico G. GuimarĂŁes, Th. Lust, R. C. Cruz : “Multi-objective approaches for the open-pit mining operational planning problem”, Electronic Notes in Discrete Mathematics, vol. 39, pp. 233-240 (2012)
- Th. Lust, J. Teghem : “The multiobjective multidimensional knapsack problem: a survey and a new approach”, International Transactions in Operational Research, vol. 19 (4), pp. 495-520, (ISBN: 0969-6016) (2012)
-
2011
- L. Galand, Th. Lust : “MĂ©thodes en deux phases pour la dĂ©termination des solutions Lorenz optimales en optimisation combinatoire biobjectif”, 12e congrès annuel de la sociĂ©tĂ© française de recherche opĂ©rationnelle et d'aide Ă la dĂ©cision, Saint-Etienne (2011)
- Th. Lust, N. Meskens : “Ordonnancement multiobjectif du bloc opĂ©ratoire”, Colloque International sur les Systèmes Industriels et Logistiques, Casablanca, Morocco (2011)
- Th. Lust, J. Teghem, D. Tuyttens : “Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems”, EMO, pp. 254-268 (2011)
-
2010
- Th. Lust, A. Jaszkiewicz : “Speed-up techniques for solving large-scale biobjective TSP”, Computers and Operations Research, vol. 37 (3), pp. 521-533 (2010)
- Th. Lust, J. Teghem : “Two-phase Pareto local search for the biobjective traveling salesman problem”, Journal of Heuristics, vol. 16 (3), pp. 475-510, (ISBN: 1381-1231) (2010)
- Th. Lust, J. Teghem : “The Multiobjective Traveling Salesman Problem: A Survey and a New Approach”, chapitre de Advances in Multi-Objective Nature Inspired Computing, pp. 119-141 (2010)
-
2009
- Th. Lust, F. Riane, O. Roux : “Exact and heuristic methods for the selective maintenance problem”, European Journal of Operational Research, vol. 197 (3), pp. 1166-1177, (ISBN: 0377-2217) (2009)
- Th. Lust, J. Teghem : “Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy”, EMO, pp. 335-349 (2009)
-
2008
- Th. Lust, J. Teghem : “MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization”, RAIRO Operations Research, vol. 42 (1), pp. 3-33, (ISBN: 0399-0559) (2008)
- Th. Lust : “Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search”, GECCO, pp. 761-762 (2008)
-
2007
- Th. Lust, J. Teghem : “Two Phase Stochastic Local Search Algorithms for the Biobjective Traveling Salesman Problem”, Stochastic Local Search Workshop (SLS-DS 2007), Brussels, Belgium, pp. 21-25 (2007)