Discrete Optimization

Optimization tasks that involve discrete decisions are ubiquitous in mathematics, industry, and business. Examples include the planning of transportation systems, e.g., public transport or gas transportation. Here, one has to choose among a set of discrete options, i.e., to select a certain integral number of objects (e.g., busses, frequencies, etc.) or to turn certain options on/off (e.g., to close a valve). These problems are modelled as mathematical optimization problems. Typically such problems become large in practice and are inherently hard to solve. Thus, an array of techniques is needed in order to be able to sucessfully handle them.

The research group Discrete Optimization develops methods, algorithms, and software to deal with such discrete optimization problems. In particular, methods from integer and combinatorial optimization are developed.

Our research group is engaged, among others, in the following projects:

 The research group Discrete Optimization had been previously formed by undefinedAlexander Martin. Detailed and updated information of their work can be found on their undefinedwebsite in Erlangen. There remains a strong collaboration.

We are looking for student research assistants.



Discrete Optimization

Prof. Dr. Marc Pfetsch  
Office: S4|10 144
Phone: +49 (0)6151 16-3394
Fax: +49 (0)6151 16-3954

Secretary's Office

Ursula Röder
Office: S4|10 138
Phone: +49 (0)6151 16-4700
Fax: +49 (0)6151 16-3954
roeder (at) mathematik.tu-darmstadt.de


Dolivostraße 15
64293 Darmstadt

A A A | Print Drucken | Impressum Impressum | Contact Kontakt
    zum Seitenanfangzum Seitenanfang