Combinatorial Optimization

Abstract

Combinatorial optimization is a fundamental branch of applied mathematics and computer science.

It is related to optimization problems where the general aim is to select the best solution among a discrete set of feasible ones.

We study fundamental problems originating from this field, with particular focus on operations research models, algorithm development and computational complexity theory.