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
Project Related Publications
Our most recent peer reviewed publications
-
Cutting Plane Approaches for the Robust Kidney Exchange Problem
Computers & Operations Research (2024) -
Rejection-proof mechanisms for multi-agent kidney exchange
Games and Economic Behavior (2024) -
A Tight (3/2+ε) Approximation for Skewed Strip Packing
Algorithmica (2023) -
Immunized Patients Face Reduced Access to Transplantation in the Eurotransplant Kidney Allocation System
Transplantation (2023) -
The flexibility of home away pattern sets
Journal of Scheduling (2023)
Contact
-
Postal address
Department of Mathematics and Computer SciencePO Box 5135600 MB EindhovenNetherlands -
Postal address
Department of Mathematics and Computer SciencePO Box 5135600 MB EindhovenNetherlands -
Visiting address
MetaForumGroene Loper 55612 AP EindhovenNetherlands -
Teamleadf.c.r.spieksma@ tue.nl