We are recruiting a postdoctoral researcher to work on approximation and
complexity of robust combinatorial optimization problems, such as robust
scheduling, robust bin packing, robust min max min, ...
The postdoc will work at the LIRMM laboratory (Montpellier) with Marin
Bougeret and Michael Poss. The duration of the position is one year, with a
possible extension of 4-6 months. The salary is roughly 2000€ per month.
The candidate could start anytime.
Interested candidates should send their CV (including submitted papers) and
at least one letter of recommendation to michael.poss@lirmm.fr.
--
====================================
Michael Poss, HdR
CNRS researcher in computer science.
www.lirmm.fr/users/utilisateurs-lirmm/michael-poss
LIRMM UMR CNRS 5506
Université de Montpellier
FRANCE
====================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
