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
Recent Publications
Our most recent peer reviewed publications
-
Extending a conjecture of Graham and Lovász on the distance characteristic polynomial
Linear Algebra and Its Applications (2024) -
A simple method for convex optimization in the oracle model
Mathematical Programming (2024) -
The role of rationality in integer-programming relaxations
Mathematical Programming (2024) -
On the Existence of Small Strictly Neumaier Graphs
Graphs and Combinatorics (2024) -
Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs
INFORMS Journal on Computing (2024)
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