Research Areas: Algorithms Discrete and Combinatorial Optimization Operations Research Linear and Integer Programming Mathematical Programming
An immense number of problems we encounter in various realms of science and engineering are inherently NP-hard. The focus of research activities in this lab is the design and analysis of exact and inexact algorithms for NP-hard discrete optimization problems. For solving such problems, we try to apply methods developed in mathematical programming, operations research, artificial intelligence, and constraint programming.