After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

Project portfolio selection (PPS) is a complex problem faced by major companies whenever
there are multiple funding opportunities with insufficient budget to fund them all. In this …

In this article, we propose an indicator-based branch and bound (I-BB) approach for multi-
objective combinatorial optimization that uses a best-first search strategy. In particular …

Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …

Abstract Discrete Graphical Models (GMs) are widely used in Artificial Intelligence to
describe complex systems through a joint function of interest. Probabilistic GMs such as …

The multi-dimensional knapsack problem (MDKP) is a well-known NP-hard problem in
combinatorial optimization. As it has various real-life applications, the MDKP has been …

This manuscript presents the research activities I conducted as an Associate Professor
(«Maître de Conférences») with the University of Lille since 2010. They deal with search …

This Ph. D. thesis deals with two different classes of optimization problems: knapsack
problems and tool switching problems. Knapsack problems became a classical and rich …

Multi-objective optimization problems, which consider multiple objective functions to be
optimized, can arise in many real-life scenarios, eg, when trying to minimize both the cost …

Many Combinatorial Optimization problems consider several, often conflicting, objectives.
This thesis deals with Local Search, data structures and Monte Carlo Search methods for …