We investigate complex discrete optimization problems that arise at the interface of operations research, applied mathematics, and theoretical computer science. A primary goal is to design (exact, approximate, and heuristic) algorithms to solve such problems. The development of such algorithms heavily exploits advanced techniques in the areas of mathematical programming, polyhedral combinatorics, graph theory and network design. Typical application areas are scheduling, production planning, logistics, telecommunication/routing networks, game theory, health care, data science.
* – Disclaimer: this list is automatically recovered from the TU/e Pure repository. Due to difficulties in integrating the pure API in wordpress there might be repetitions and it might not be fully representative of all recent publications.