========================================================================================================================================
Looking for candidates to a Full Professor position in Computer Science
specialized in Operation Research and/or Mathematical Programming
========================================================================================================================================
A Full Professor position is available at the University Paris 13
attached to the LIPN (Laboratory of Computer Science of Paris Nord) as
for research and attached to the Computer Science Departement of the
Galileo Institute as for teaching.
Knowledge of French is requested.
The application process is open, it closes on October 4, 2010.
Post 27 PR 0167
================
Profile : Computer Science
LIPN, Institut Galilée, Université Paris 13
Teaching Profile
================
The recruited professor will teach courses at the Computer Science
Department of the Galileo Institute of the University Paris 13.
Recherche Profile
=================
The LIPN (http://www-lipn.univ-paris13.fr/) wishes to reinforce
one of its 5 teams by recruiting a full professor. The teams are:
* Machine Learning & Applications (A3)
* Algorithms and Combinatorial Optimization (AOC)
* Combinatorial, Algorithmic and Interactions (CALIN)
* Logic, Calculation and Reasoning (LCR)
* Knowledge Management and Natural Language (RCLN)
OC group of LIPN
==========================
Contact : Roberto Wolfler Calvo, wolfler@lipn.univ-paris13.fr
The Combinatorial Optimization group (OC) of the AOC team (Algorithms
and Combinatorial Optimization) undertakes both fundamental theoretical
researches and industrial applications in Integer Programming and
Combinatorial Optimization. It consists today of a professor emeritus,
two full professors and six associate professors. The group handles the
traditional and strongly complementary approaches of Combinatorial
Optimization which are: mathematical programming, complexity, modeling,
graph theory, exact methods and metaheuristics. Research is articulated
around three axes:
- the definition of innovative solution methods in mathematical
programming (re-optimization, reformulation);
- the study of structural properties of the problems (decompositions and
relaxations, polyedral structure, approximation algorithms);
- the developement of exact and approximate methods for solving
real-life problems (as for example: planning and scheduling of
resources, logistics and vehicles routing, multimodal transport, design
of networks).
The group has a particular expertise in the development of mathematical
programming methods for the solution of very large scale problems. More
recently, it has developed original research axes within the framework
of collaborations with other fields such as data mining and mathematics.
Key words: combinatorial optimization, discrete applied mathematics,
integer programming, graph theory, polyhedral approaches, approximation,
robustness.
More information / further contacts
===================================
Information :
Laboratory : http://www-lipn.univ-paris13.fr
Institut : http://www-galilee.univ-paris13.fr/
Computer Science departement : http://www-lipn.univ-paris13.fr/~bennani/cdi
Contacts :
Chef of the laboratory : Christophe Fouqueré :
christophe.fouquere@lipn.univ-paris13.fr
Chef of the departement : Younès Bennani :
younes.bannani@lipn.univ-paris13.fr
For futher details on the postion (in french) :
http://www-lipn.univ-paris13.fr/~fouquere/Postes/
**********************************************************
*
* 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
