( en | de | ru )

 

Disambiguation of "Lust, Thibaut"

Author of the publication

copydeleteadd this publication to your clipboard
An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information.

, and . SUM, volume 11940 of Lecture Notes in Computer Science, page 221-235. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dieter Lust

Siegmund Lust

Friedrich Lüst

Dieter Lüst

Andreas Lust

 

Other publications of authors with the same name

Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization., , , and . AAAI, page 12233-12240. AAAI Press, (2021)An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information., and . SUM, volume 11940 of Lecture Notes in Computer Science, page 221-235. Springer, (2019)Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems., , and . EMO, volume 6576 of Lecture Notes in Computer Science, page 254-268. Springer, (2011)Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators., , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 419-426. IOS Press, (2020)Multiagent Fair Optimization with Lorenz Dominance., and . AAMAS, page 1895-1896. ACM, (2015)Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem., and . TAAI, page 397-402. IEEE Computer Society, (2013)Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy., and . EMO, volume 5467 of Lecture Notes in Computer Science, page 335-349. Springer, (2009)Variable and large neighborhood search to solve the multiobjective set covering problem., and . J. Heuristics, 20 (2): 165-188 (2014)Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign., , , , , , , , , and . Comput. Oper. Res., (2017)A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences., and . SOCS, page 164-165. AAAI Press, (2019)