default search action
Thibaut Lust
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Mohammed Bachir Bederina, Djamal Chaabane, Thibaut Lust:
Generating Fair Solutions of Minimal Cost. ECAI 2024: 4076-4083 - 2023
- [i5]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
RIGA: A Regret-Based Interactive Genetic Algorithm. CoRR abs/2311.06063 (2023) - 2021
- [c16]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization. AAAI 2021: 12233-12240 - [c15]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Interactive Optimization of Submodular Functions Under Matroid Constraints. ADT 2021: 307-322 - 2020
- [c14]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems. AAAI 2020: 2335-2342 - [c13]Nawal Benabbou, Cassandre Leroy, Thibaut Lust:
Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators. ECAI 2020: 419-426
2010 – 2019
- 2019
- [c12]Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization. ADT 2019: 1-16 - [c11]Nawal Benabbou, Thibaut Lust:
A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. SOCS 2019: 164-165 - [c10]Nawal Benabbou, Thibaut Lust:
An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information. SUM 2019: 221-235 - 2018
- [j12]Luciano Costa
, Thibaut Lust
A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem. Networks 72(3): 311-336 (2018) - [j11]Andrzej Jaszkiewicz
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem. IEEE Trans. Evol. Comput. 22(5): 778-791 (2018) - 2017
- [j10]Andrzej Jaszkiewicz
Proper balance between search towards and along Pareto front: biobjective TSP case study. Ann. Oper. Res. 254(1-2): 111-130 (2017) - [j9]Vitor Nazário Coelho, Thays A. Oliveira, Igor Machado Coelho, Bruno N. Coelho
Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. Comput. Oper. Res. 78: 578-587 (2017) - 2016
- [i4]Andrzej Jaszkiewicz, Thibaut Lust:
ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search. CoRR abs/1603.04798 (2016) - 2015
- [c9]Thibaut Lust:
Choquet Integral Versus Weighted Sum in Multicriteria Decision Contexts. ADT 2015: 288-304 - [c8]Lucie Galand, Thibaut Lust:
Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems. ADT 2015: 305-321 - [c7]Lucie Galand, Thibaut Lust:
Multiagent Fair Optimization with Lorenz Dominance. AAMAS 2015: 1895-1896 - 2014
- [j8]Thibaut Lust, Daniel Tuyttens:
Variable and large neighborhood search to solve the multiobjective set covering problem. J. Heuristics 20(2): 165-188 (2014) - [c6]Thibaut Lust, Antoine Rolland
2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems. IPMU (1) 2014: 256-265 - [i3]Thibaut Lust, Nadine Meskens, Mario Ahues:
Predicting academic success in Belgium and France Comparison and integration of variables related to student behavior. CoRR abs/1408.4955 (2014) - 2013
- [j7]Thibaut Lust, Antoine Rolland
Choquet optimal set in biobjective combinatorial optimization. Comput. Oper. Res. 40(10): 2260-2269 (2013) - [c5]Thibaut Lust, Antoine Rolland
On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts. MIWAI 2013: 131-142 - [c4]Thibaut Lust, Daniel Tuyttens:
Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem. TAAI 2013: 397-402 - 2012
- [j6]Vitor Nazário Coelho, Marcone J. F. Souza
Multi-objective approaches for the open-pit mining operational planning problem. Electron. Notes Discret. Math. 39: 233-240 (2012) - [j5]Thibaut Lust, Jacques Teghem:
The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19(4): 495-520 (2012) - 2011
- [c3]Thibaut Lust, Jacques Teghem, Daniel Tuyttens:
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. EMO 2011: 254-268 - 2010
- [j4]Thibaut Lust, Andrzej Jaszkiewicz
Speed-up techniques for solving large-scale biobjective TSP. Comput. Oper. Res. 37(3): 521-533 (2010) - [j3]Thibaut Lust, Jacques Teghem:
Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3): 475-510 (2010) - [p1]Thibaut Lust, Jacques Teghem:
The Multiobjective Traveling Salesman Problem: A Survey and a New Approach. Advances in Multi-Objective Nature Inspired Computing 2010: 119-141 - [i2]Thibaut Lust, Jacques Teghem:
Multiobjective decomposition of integer matrices: application to radiotherapy. CoRR abs/1006.1031 (2010) - [i1]Thibaut Lust, Jacques Teghem:
The multiobjective multidimensional knapsack problem: a survey and a new approach. CoRR abs/1007.4063 (2010)
2000 – 2009
- 2009
- [j2]Thibaut Lust, Olivier Roux, Fouad Riane:
Exact and heuristic methods for the selective maintenance problem. Eur. J. Oper. Res. 197(3): 1166-1177 (2009) - [c2]Thibaut Lust, Jacques Teghem:
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy. EMO 2009: 335-349 - 2008
- [j1]Thibaut Lust, Jacques Teghem:
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. RAIRO Oper. Res. 42(1): 3-33 (2008) - [c1]Thibaut Lust:
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search. GECCO 2008: 761-762
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-10-28 20:15 CET 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: