Department of Mathematics and Computer Science

Combinatorial Optimization

The Combinatorial Optimization group investigates the structure and relationship between different problems, in order to design efficient and effective algorithms for solving them.

image

Combinatorial Optimization: finding an optimal solution from a finite set of solutions

Countless practical optimization problems are, in fact, combinatorial optimization problems: they have an optimal solution that needs to be found amongst a finite set of possible solutions. The aim of combinatorial optimization (CO) is to rapidly and efficiently find such an optimal solution.

CO is related to discrete mathematics, theoretical computer science, applied mathematics, operations research, algorithm theory and computational complexity theory and has important applications in several fields. These include scheduling, production planning, logistics, network design, communication and routing in networks, health care, artificial intelligence, machine learning, auction theory, and software engineering.

Meet some of our Researchers

Contact