Optimization / Constraint programming at LAAS-CNRS, Toulouse, France.
The research team ''Operations Research, Combinatorial Optimization and
Constraints'' (ROC) at LAAS-CNRS is accepting applications for a
1-year post doctoral position.
The eligible research topics are related to all aspects of combinatorial
optimization, mathematical programming and constraint programming. The
candidate is invited to contact the research team to build a research
project. In particular the team interests involve but are not limited to:
- Mixed integer (non)linear programming (MI(N)LP)
- Constraint programming (CP)
- Boolean satisfiability (SAT)
- Hybrid MI(N)LP/CP/SAT approaches for combinatorial or mixed optimization
- Interactions between combinatorial optimization and machine learning
- Scheduling
- Vehicle routing
- Robust discrete optimization
- Complexity and approximation
- Graph theory
- Multi objective and multi agent optimization
More details on the research of the ROC team can be found at
https://www.laas.fr/public/en/roc
As a potential follow-up, the candidate, if interested, can benefit from
the team support to apply to a permanent CNRS research position in 2022.
To apply please send a letter of motivation and a curriculum vitae
before November 30th to application-roc@laas.fr
**********************************************************
*
* 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
