Research Output per year

# Organization profile

### Introduction / mission

The Combinatorial Optimization group investigates the structure and relationship between different problems, in order to design efficient and effective algorithms for solving them.

### Highlighted phrase

Combinatorial Optimization: finding an optimal solution from a finite set of solutions

### Organisational profile

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.

The Combinatorial Optimization (CO) group at Eindhoven University of Technology (TU/e) focuses on the analysis and solution of discrete algorithmic problems that are computationally difficult. The group investigates the structure of such problems, analyzes the relations between different problems, and uses this knowledge to design efficient and effective algorithms for solving them. We study both exact and heuristic algorithms. The Group is also interested in combinatorial optimization problems where the input is revealed only gradually, or where there is uncertainty in the parameters, leading to online, stochastic or robust solution methods.

Combinatorial Optimization develops theoretic results, for instance in graph theory and matroids, and apply these to real-world situations. Typical application areas are scheduling, production planning, logistics, network design, communication and routing in networks, and health care. The Group cooperates with KU Leuven, CWI (National Research Institute for Mathematics and Computer Science) and DIAMANT (Discrete, Interactive and Algorithmic Mathematics, Algebra and Number Theory, Dutch mathematics cluster).

Research focuses on:

- polyhedral techniques
- local search methods
- performance guarantee for approximation algorithms
- online route planning
- scheduling
- matroid structure and visualization
- network problems

## Fingerprint Dive into the research topics where Combinatorial Optimization is active. These topic labels come from the works of this organisation's members. Together they form a unique fingerprint.

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Profiles

## Nikhil Bansal

- Department of Mathematics and Computer Science, Combinatorial Optimization
- Department of Mathematics and Computer Science, Discrete Mathematics W&I - Full Professor
- Department of Mathematics and Computer Science, Discrete Mathematics - Full Professor

Person: HGL : Professor

## Cor A.J. Hurkens

- Department of Mathematics and Computer Science, Discrete Mathematics - Assistant Professor
- Department of Mathematics and Computer Science, Combinatorial Optimization - Assistant Professor
- Department of Mathematics and Computer Science, Discrete Mathematics W&I - Assistant Professor

Person: UD : Assistant Professor

## Jesper Nederlof

- Department of Mathematics and Computer Science, Combinatorial Optimization
- Department of Mathematics and Computer Science, Discrete Mathematics - Assistant Professor
- Department of Mathematics and Computer Science, Discrete Mathematics W&I - Assistant Professor

Person: UD : Assistant Professor

## Research Output 1988 2020

## Asymptotics of symmetry in matroids

Pendavingh, R. & van der Pol, J., 1 Mar 2019, In : Journal of Combinatorial Theory, Series B. 135, p. 349-365 17 p.Research output: Contribution to journal › Article › Academic › peer-review

## Building Kidney Exchange Programmes in Europe: an overview of exchange practice and activities

Biro, P., Haase-Kromwijk, B., Andersson, T., Ásgeirsson, E., Baltesová, T., Boletis, I., Bolotinha, C., Bond, G., Böhmig, G., Burnapp, L., Cechlárová, K., Di Caccio, P., Fronek, J., Hadaya, K., Hemke, A., Jacquelinet, C., Johnson, R., Kieszek, R., Kuypers, D., Leisman, R. & 10 others, , 1 Jul 2019, In : Transplantation. 103, 7, p. 1514-1522 9 p.Research output: Contribution to journal › Article › Academic › peer-review

## Column generation based heuristic for learning classification trees

Firat, M., Crognier, G., Gabor, A. F., Hurkens, C. A. J. & Zhang, Y., 11 Dec 2019, (Accepted/In press) In : Computers & Operations Research. 116, 11 p., 104866.Research output: Contribution to journal › Article › Academic › peer-review

## Prizes

## Algorithms for coping with uncertainty and intractability

N. Bansal (Recipient), 2013

Prize: ERC › Consolidator › Scientific

## Faster algorithms in computer science

Jesper Nederlof (Recipient), 2019

Prize: ERC › Starting › Scientific

## NWO Vici Award : Continuous Methods in Discrete Optimization

N. Bansal (Recipient), 2018

Prize: NWO › Vici › Scientific

## Press / Media

## EECS Distinguished Speaker: Prof. Nikhil Bansal, Professor, Department of Mathematics and Computer Science Eindhoven University of Technology, "Can we Design Clean Algorithms for Messy Problems"

23/10/18

1 item of Media coverage

Press/Media: Expert Comment

## ACUITY: Algorithms for coping with uncertainty and intractability

8/11/16

1 item of Media coverage

Press/Media: Expert Comment

## Are mobile apps the future? Highlights from Myntra’s mobile hack day

29/04/15

1 item of Media coverage

Press/Media: Expert Comment

## Student theses

## Algorithms for parallel machine scheduling with a sequence dependent cost function: application in a printed circuit board assembly production environment

Author: Reusken, E., 28 Oct 2019Supervisor: Buchin, K. A. (Supervisor 1), Spieksma, F. C. (Supervisor 2), Kowalczyk, D. (Supervisor 2), van de Ven, M. (External person) (External coach) & de Wit, L. (External person) (External coach)

Student thesis: Master

## Analysis of an algorithm for finding perfect matching in k-regular bipartite graphs

Author: Blom, D. A., 31 Aug 2017Supervisor: Pendavingh, R. (Supervisor 1)

Student thesis: Bachelor

## Automated typesetting: the mathematics of beautiful texts

Author: Roordink, J., 15 Aug 2019Supervisor: Hurkens, C. (Supervisor 1)

Student thesis: Bachelor