Year
Field
# Hours
L3
MASS
40
L2
IUP Miage
9
M1
MASS
30
L3
MI2E
30
NP-hard problems
M2
MODO
18
M2
ID
12
L1
MI2E
12
L3
LSO
20
L1
DUGEAD 1
36
L1
MASS
42
L1
DUMI2E 1
15
L3
LSG
42
M1
MIAGE-MODO
18
Teaching 2009-2010:
- Exponential algorithms for solving NP-hard problems, M2 MODO
- Metaheuristics and combinatorial optimization, M2 Informatique Décisionnelle
- Graph Theory, L3 MI2E mathématiques et informatiques
- Automata, M1 Miage&D
All the documents for students are on the website MyCourse of Dauphine.
All my teaching
Year
|
Field |
# Hours |
||
| Operations Research | ||||
|
Graph Theory | L3 |
MASS |
40 |
|
Linear Programming | L2 |
IUP Miage |
9 |
|
Linear Programming | M1 |
MASS |
30 |
|
Combinatorics and graph algorithms | L3 |
MI2E |
30 |
|
Exponential algorithms for solving NP-hard problems |
M2 |
MODO |
18 |
|
Metaheuristics and combinatorial optimization | M2 |
ID |
12 |
|
Operations Research - Excel | L1 |
MI2E |
12 |
|
Scientific Management for Decision Aiding | L3 |
LSO |
20 |
| Algorithms - Programming | ||||
|
Programming - Maple | L1 |
DUGEAD 1 |
36 |
|
Algorithms - Programming Java | L1 |
MASS |
42 |
| Data bases | ||||
|
Data bases - Access | L1 |
DUMI2E 1 |
15 |
|
Data bases - Access | L3 |
LSG |
42 |
| Theoretical computer science | ||||
|
Automata, languages and applications | M1 |
MIAGE-MODO |
18 |