Wednesday, November 4, 2009

PhD/Postdoc position in computational mathematical programming

The Discrete Optimization Group at the Technical University
Darmstadt, Germany,,
invites applications for

(Wissenschaftliche/r Mitarbeiter/in, TV-H 13, ~BAT IIa)

to work on the project

"Generic Decomposition Algorithms for Integer Programs"

funded by the German Research Foundation (DFG) within the
priority program "algorithm engineering". The position is
immediately available and should start no later than January
1, 2010. The contract is limited to two years, with a
perspective for an extension for two more years. There is the
possibility to work towards a Ph.D. degree, but postdocs are
equally welcome.

The project offers an attractive balance between theoretical
research and experimental work on a "hot topic" in
computational mathematical programming. The aim is to develop
general purpose algorithms for solving integer programs via
decomposition approaches such as Dantzig/Wolfe's. The
successful candidate will participate in the development of a
theoretical and algorithmic understanding of "automated
decompositions" based on structural analyses which may imply
graph theoretic, combinatorial, and polyhedral considerations.
These findings are to be implemented and evaluated within a
generic framework, which we will make available to the
research community. It is most likely that the project will
touch upon practical applications as well.

We offer a friendly and professional working environment with
a pronounced team spirit. Our group has some 15 researchers,
PhD students and postdocs, interested in discrete
optimization, integer programming (linear and non-linear), and
algorithms in a broad sense.

You need to have a Master's/Diplom degree (or above) in
(discrete) mathematics, computer science, or a related
discipline. Strong implementation skills (preferably C/C++)
and an affinity to computational work are a must. A solid
knowledge in at least one of combinatorial optimization,
algorithm design and analysis, or integer programming are
assets. Ideally, you have already applied a branch-and-price
algorithm to some problem [and if you haven't you will learn
about the state-of-the-art soon...].

Please send your application in PDF with the usual material and a
short letter of motivation no later than November 25, 2009 to

Questions about the project can be directed to the same address

Dr. habil. Marco Luebbecke
Technische Universitaet Darmstadt
Fachbereich Mathematik, AG Optimierung phone: +49 6151 16-70867
Dolivostr. 15 fax: +49 6151 16-3954
D-64293 Darmstadt