At the frontier of Operations Research, Algorithms, and Constraint
Programming, my research focuses on hard combinatorial feasibility and
optimization problems as they arise in the context of real-world
applications. Particularly, I have worked on:
I am especially interested in the
integration of methods from mathematical programming, approximation
theory, and constraint propagation, which has proven very successful
in boosting the solution efficiency for discrete feasibility and
optimization problems.
While an important aim for me is to provide actual software systems
that can tackle real-world applications efficiently, the abstraction
and generalization of originally problem-tailored approaches to
standard solution methods that facilitate algorithm design and
algorithm engineering for constraint satisfaction and constrained
optimization is a key part of my work. My main methodological
contributions to this line of research were: