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
Our most recent peer reviewed publications
Hamiltonicity below Dirac’s condition45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 (2019)
Computing the chromatic number using graph decompositions via matrix rankTheoretical Computer Science (2019)
Building Kidney Exchange Programmes in EuropeTransplantation (2019)
Online interval scheduling on two related machinesJournal of Combinatorial Optimization (2019)
On a generalization of iterated and randomized rounding51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 (2019)