Exact and approximate solving approaches in multi-objective combinatorial optimization, application to the minimum weight spanning tree problem. (Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal). - Renaud Lacour (2014)

On the representation of the search region in multi-objective optimization. - Kathrin Klamroth; Renaud Lacour; Daniel Vanderpooten (Eur. J. Oper. Res., 2015)

A box decomposition algorithm to compute the hypervolume indicator. - Renaud Lacour; Kathrin Klamroth; Carlos M. Fonseca (Comput. Oper. Res., 2017)

Efficient computation of the search region in multi-objective optimization. - Kerstin Dächert; Kathrin Klamroth; Renaud Lacour; Daniel Vanderpooten (Eur. J. Oper. Res., 2017)

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs. - Anthony Przybylski; Kathrin Klamroth; Renaud Lacour (CoRR, 2019)