Eranda
Dragoti-Çela
Research Interests
-
Combinatorial optimization
(CO)
-
Polynomially solvable versions
of NP-hard CO problems
-
Assignment problems: linear,
quadratic, and multidimensional.
-
Location problems
-
Mathematical models in portfolio optimization: theory and applications
- Risk measures
-
Robust optimization
cela@opt.math.tu-graz.ac.at.
Back
to my homepage
Last Update: April 2008